./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label38.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7493d306d44d9507b84459ae39e255658015ac06dd9b543cde90600f3bafda06 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:11:59,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:11:59,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:11:59,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:11:59,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:11:59,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:11:59,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:11:59,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:11:59,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:11:59,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:11:59,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:11:59,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:11:59,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:11:59,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:11:59,233 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:11:59,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:11:59,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:11:59,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:11:59,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:11:59,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:11:59,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:11:59,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:11:59,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:11:59,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:11:59,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:11:59,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:11:59,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:11:59,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:11:59,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:11:59,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:11:59,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:11:59,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:11:59,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:11:59,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:11:59,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:11:59,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:11:59,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:11:59,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:11:59,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:11:59,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:11:59,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:11:59,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:11:59,240 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7493d306d44d9507b84459ae39e255658015ac06dd9b543cde90600f3bafda06 [2024-11-08 11:11:59,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:11:59,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:11:59,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:11:59,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:11:59,458 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:11:59,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label38.c [2024-11-08 11:12:00,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:12:00,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:12:00,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c [2024-11-08 11:12:00,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac18e2381/4d39f5420edf48e39153554907aec060/FLAG5775b0d86 [2024-11-08 11:12:00,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac18e2381/4d39f5420edf48e39153554907aec060 [2024-11-08 11:12:00,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:12:00,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:12:00,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:12:00,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:12:00,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:12:00,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:00" (1/1) ... [2024-11-08 11:12:00,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@972382c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:00, skipping insertion in model container [2024-11-08 11:12:00,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:00" (1/1) ... [2024-11-08 11:12:01,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:12:01,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c[8652,8665] [2024-11-08 11:12:01,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:12:01,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:12:01,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c[8652,8665] [2024-11-08 11:12:01,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:12:01,502 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:12:01,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01 WrapperNode [2024-11-08 11:12:01,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:12:01,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:12:01,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:12:01,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:12:01,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,603 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:12:01,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:12:01,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:12:01,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:12:01,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:12:01,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,723 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:12:01,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:12:01,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:12:01,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:12:01,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:12:01,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (1/1) ... [2024-11-08 11:12:01,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:12:01,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:12:01,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:12:01,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:12:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:12:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:12:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:12:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:12:01,943 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:12:01,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:12:03,058 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:12:03,058 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:12:03,075 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:12:03,077 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:12:03,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:03 BoogieIcfgContainer [2024-11-08 11:12:03,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:12:03,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:12:03,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:12:03,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:12:03,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:12:00" (1/3) ... [2024-11-08 11:12:03,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd258b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:03, skipping insertion in model container [2024-11-08 11:12:03,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:01" (2/3) ... [2024-11-08 11:12:03,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd258b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:03, skipping insertion in model container [2024-11-08 11:12:03,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:03" (3/3) ... [2024-11-08 11:12:03,085 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label38.c [2024-11-08 11:12:03,097 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:12:03,098 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:12:03,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:12:03,163 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@128df2e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:12:03,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:12:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 11:12:03,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:03,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:03,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:03,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2024-11-08 11:12:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:03,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046286937] [2024-11-08 11:12:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:03,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:03,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046286937] [2024-11-08 11:12:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046286937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:03,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907197772] [2024-11-08 11:12:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:03,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:03,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:03,560 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:04,419 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-08 11:12:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-08 11:12:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:04,431 INFO L225 Difference]: With dead ends: 761 [2024-11-08 11:12:04,431 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 11:12:04,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:04,437 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 168 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:04,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:12:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 11:12:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-08 11:12:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-08 11:12:04,487 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 60 [2024-11-08 11:12:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-08 11:12:04,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-08 11:12:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 11:12:04,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:04,492 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:12:04,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:04,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -432857926, now seen corresponding path program 1 times [2024-11-08 11:12:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893395013] [2024-11-08 11:12:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:04,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:04,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893395013] [2024-11-08 11:12:04,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893395013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:04,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:04,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:04,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841815966] [2024-11-08 11:12:04,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:04,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:04,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:04,651 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:05,315 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-08 11:12:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-08 11:12:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:05,322 INFO L225 Difference]: With dead ends: 1211 [2024-11-08 11:12:05,323 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 11:12:05,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:05,325 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:05,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:12:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 11:12:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-08 11:12:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-08 11:12:05,352 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 128 [2024-11-08 11:12:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:05,352 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-08 11:12:05,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-08 11:12:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 11:12:05,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:05,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:05,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:12:05,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:05,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:05,355 INFO L85 PathProgramCache]: Analyzing trace with hash -696650283, now seen corresponding path program 1 times [2024-11-08 11:12:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:05,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74967530] [2024-11-08 11:12:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:05,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74967530] [2024-11-08 11:12:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74967530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:05,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:05,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150919169] [2024-11-08 11:12:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:05,647 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:06,186 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-08 11:12:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:06,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2024-11-08 11:12:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:06,190 INFO L225 Difference]: With dead ends: 1945 [2024-11-08 11:12:06,190 INFO L226 Difference]: Without dead ends: 1158 [2024-11-08 11:12:06,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:06,192 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:06,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:12:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-08 11:12:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-08 11:12:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-08 11:12:06,214 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 130 [2024-11-08 11:12:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:06,214 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-08 11:12:06,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-08 11:12:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 11:12:06,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:06,220 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:06,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:12:06,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:06,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1739360937, now seen corresponding path program 1 times [2024-11-08 11:12:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:06,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777391414] [2024-11-08 11:12:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:06,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777391414] [2024-11-08 11:12:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777391414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:06,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:06,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12382669] [2024-11-08 11:12:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:06,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:12:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:12:06,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:12:06,393 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:07,427 INFO L93 Difference]: Finished difference Result 3445 states and 4564 transitions. [2024-11-08 11:12:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:12:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-11-08 11:12:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:07,434 INFO L225 Difference]: With dead ends: 3445 [2024-11-08 11:12:07,435 INFO L226 Difference]: Without dead ends: 2474 [2024-11-08 11:12:07,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:12:07,437 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 334 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:07,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 87 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:12:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2024-11-08 11:12:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2473. [2024-11-08 11:12:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 1.286812297734628) internal successors, (3181), 2472 states have internal predecessors, (3181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3181 transitions. [2024-11-08 11:12:07,475 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3181 transitions. Word has length 187 [2024-11-08 11:12:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:07,476 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3181 transitions. [2024-11-08 11:12:07,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3181 transitions. [2024-11-08 11:12:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 11:12:07,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:07,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:07,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:12:07,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:07,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1823294191, now seen corresponding path program 1 times [2024-11-08 11:12:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095167119] [2024-11-08 11:12:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:12:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095167119] [2024-11-08 11:12:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095167119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142765169] [2024-11-08 11:12:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:07,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:07,727 INFO L87 Difference]: Start difference. First operand 2473 states and 3181 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:08,357 INFO L93 Difference]: Finished difference Result 5690 states and 7506 transitions. [2024-11-08 11:12:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-08 11:12:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:08,370 INFO L225 Difference]: With dead ends: 5690 [2024-11-08 11:12:08,371 INFO L226 Difference]: Without dead ends: 3587 [2024-11-08 11:12:08,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:08,374 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:08,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 393 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:12:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2024-11-08 11:12:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3578. [2024-11-08 11:12:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3578 states, 3577 states have (on average 1.25020967291026) internal successors, (4472), 3577 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 4472 transitions. [2024-11-08 11:12:08,419 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 4472 transitions. Word has length 242 [2024-11-08 11:12:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:08,420 INFO L471 AbstractCegarLoop]: Abstraction has 3578 states and 4472 transitions. [2024-11-08 11:12:08,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4472 transitions. [2024-11-08 11:12:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 11:12:08,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:08,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:12:08,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:08,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1037701986, now seen corresponding path program 1 times [2024-11-08 11:12:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997600237] [2024-11-08 11:12:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 91 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:12:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997600237] [2024-11-08 11:12:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997600237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:12:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289587179] [2024-11-08 11:12:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:12:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:12:08,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:12:08,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:12:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:08,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:12:09,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:12:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:12:09,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:12:09,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289587179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:09,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:12:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:12:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726862880] [2024-11-08 11:12:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:09,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:09,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:12:09,098 INFO L87 Difference]: Start difference. First operand 3578 states and 4472 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:09,737 INFO L93 Difference]: Finished difference Result 9363 states and 11939 transitions. [2024-11-08 11:12:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-08 11:12:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:09,760 INFO L225 Difference]: With dead ends: 9363 [2024-11-08 11:12:09,760 INFO L226 Difference]: Without dead ends: 6155 [2024-11-08 11:12:09,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:12:09,768 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 151 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:09,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 145 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:12:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2024-11-08 11:12:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 6155. [2024-11-08 11:12:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 6154 states have (on average 1.2351316217094572) internal successors, (7601), 6154 states have internal predecessors, (7601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 7601 transitions. [2024-11-08 11:12:09,850 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 7601 transitions. Word has length 248 [2024-11-08 11:12:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:09,851 INFO L471 AbstractCegarLoop]: Abstraction has 6155 states and 7601 transitions. [2024-11-08 11:12:09,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 7601 transitions. [2024-11-08 11:12:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-08 11:12:09,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:09,856 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:09,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:12:10,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 11:12:10,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:10,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash 855336243, now seen corresponding path program 1 times [2024-11-08 11:12:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698268187] [2024-11-08 11:12:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:12:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698268187] [2024-11-08 11:12:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698268187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:12:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298306829] [2024-11-08 11:12:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:10,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:12:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:12:10,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:12:10,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:12:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:10,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:12:10,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:12:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:12:10,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:12:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:12:15,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298306829] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:12:15,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:12:15,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-08 11:12:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340178091] [2024-11-08 11:12:15,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:15,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:12:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:12:15,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:12:15,730 INFO L87 Difference]: Start difference. First operand 6155 states and 7601 transitions. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:17,098 INFO L93 Difference]: Finished difference Result 13973 states and 17912 transitions. [2024-11-08 11:12:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:12:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2024-11-08 11:12:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:17,123 INFO L225 Difference]: With dead ends: 13973 [2024-11-08 11:12:17,124 INFO L226 Difference]: Without dead ends: 9114 [2024-11-08 11:12:17,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:12:17,132 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 279 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:17,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 170 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:12:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9114 states. [2024-11-08 11:12:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9114 to 7996. [2024-11-08 11:12:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7996 states, 7995 states have (on average 1.2215134459036898) internal successors, (9766), 7995 states have internal predecessors, (9766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7996 states to 7996 states and 9766 transitions. [2024-11-08 11:12:17,278 INFO L78 Accepts]: Start accepts. Automaton has 7996 states and 9766 transitions. Word has length 279 [2024-11-08 11:12:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:17,279 INFO L471 AbstractCegarLoop]: Abstraction has 7996 states and 9766 transitions. [2024-11-08 11:12:17,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7996 states and 9766 transitions. [2024-11-08 11:12:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-08 11:12:17,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:17,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:17,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:12:17,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 11:12:17,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:17,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1067749938, now seen corresponding path program 1 times [2024-11-08 11:12:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:17,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489129235] [2024-11-08 11:12:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-08 11:12:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489129235] [2024-11-08 11:12:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489129235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:17,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:17,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:17,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337908107] [2024-11-08 11:12:17,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:17,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:17,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:17,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:17,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:17,617 INFO L87 Difference]: Start difference. First operand 7996 states and 9766 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:18,184 INFO L93 Difference]: Finished difference Result 18196 states and 22457 transitions. [2024-11-08 11:12:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2024-11-08 11:12:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:18,205 INFO L225 Difference]: With dead ends: 18196 [2024-11-08 11:12:18,205 INFO L226 Difference]: Without dead ends: 10570 [2024-11-08 11:12:18,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:18,214 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 167 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:18,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 325 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:12:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2024-11-08 11:12:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 10201. [2024-11-08 11:12:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10201 states, 10200 states have (on average 1.2079411764705883) internal successors, (12321), 10200 states have internal predecessors, (12321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 12321 transitions. [2024-11-08 11:12:18,332 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 12321 transitions. Word has length 290 [2024-11-08 11:12:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:18,333 INFO L471 AbstractCegarLoop]: Abstraction has 10201 states and 12321 transitions. [2024-11-08 11:12:18,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 12321 transitions. [2024-11-08 11:12:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-08 11:12:18,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:18,368 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:18,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:12:18,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:18,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1084447020, now seen corresponding path program 1 times [2024-11-08 11:12:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:18,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364271027] [2024-11-08 11:12:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:18,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:18,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364271027] [2024-11-08 11:12:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364271027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790778884] [2024-11-08 11:12:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:18,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:18,563 INFO L87 Difference]: Start difference. First operand 10201 states and 12321 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:19,079 INFO L93 Difference]: Finished difference Result 22434 states and 27273 transitions. [2024-11-08 11:12:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2024-11-08 11:12:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:19,081 INFO L225 Difference]: With dead ends: 22434 [2024-11-08 11:12:19,081 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:12:19,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:19,094 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 61 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:19,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 341 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:12:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:12:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:12:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:12:19,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 330 [2024-11-08 11:12:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:19,095 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:12:19,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:12:19,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:12:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:12:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:12:19,101 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:19,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:12:19,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:12:19,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:12:19 BoogieIcfgContainer [2024-11-08 11:12:19,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:12:19,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:12:19,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:12:19,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:12:19,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:03" (3/4) ... [2024-11-08 11:12:19,225 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:12:19,245 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:12:19,246 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:12:19,247 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:12:19,248 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:12:19,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:12:19,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:12:19,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:12:19,391 INFO L158 Benchmark]: Toolchain (without parser) took 18432.12ms. Allocated memory was 148.9MB in the beginning and 629.1MB in the end (delta: 480.2MB). Free memory was 120.4MB in the beginning and 538.1MB in the end (delta: -417.7MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-08 11:12:19,391 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:12:19,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.90ms. Allocated memory is still 148.9MB. Free memory was 120.2MB in the beginning and 75.6MB in the end (delta: 44.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-11-08 11:12:19,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.94ms. Allocated memory is still 148.9MB. Free memory was 75.6MB in the beginning and 57.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 11:12:19,392 INFO L158 Benchmark]: Boogie Preprocessor took 212.47ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 57.9MB in the beginning and 145.0MB in the end (delta: -87.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-08 11:12:19,393 INFO L158 Benchmark]: RCFGBuilder took 1257.18ms. Allocated memory is still 199.2MB. Free memory was 145.0MB in the beginning and 74.9MB in the end (delta: 70.1MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2024-11-08 11:12:19,393 INFO L158 Benchmark]: TraceAbstraction took 16143.08ms. Allocated memory was 199.2MB in the beginning and 629.1MB in the end (delta: 429.9MB). Free memory was 73.8MB in the beginning and 554.9MB in the end (delta: -481.0MB). Peak memory consumption was 235.2MB. Max. memory is 16.1GB. [2024-11-08 11:12:19,393 INFO L158 Benchmark]: Witness Printer took 167.74ms. Allocated memory is still 629.1MB. Free memory was 554.9MB in the beginning and 538.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:12:19,395 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.90ms. Allocated memory is still 148.9MB. Free memory was 120.2MB in the beginning and 75.6MB in the end (delta: 44.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.94ms. Allocated memory is still 148.9MB. Free memory was 75.6MB in the beginning and 57.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 212.47ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 57.9MB in the beginning and 145.0MB in the end (delta: -87.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1257.18ms. Allocated memory is still 199.2MB. Free memory was 145.0MB in the beginning and 74.9MB in the end (delta: 70.1MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16143.08ms. Allocated memory was 199.2MB in the beginning and 629.1MB in the end (delta: 429.9MB). Free memory was 73.8MB in the beginning and 554.9MB in the end (delta: -481.0MB). Peak memory consumption was 235.2MB. Max. memory is 16.1GB. * Witness Printer took 167.74ms. Allocated memory is still 629.1MB. Free memory was 554.9MB in the beginning and 538.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 196]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1558 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1558 mSDsluCounter, 1993 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 1088 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6027 IncrementalHoareTripleChecker+Invalid, 7115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1088 mSolverCounterUnsat, 1735 mSDtfsCounter, 6027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10201occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1509 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2421 NumberOfCodeBlocks, 2421 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2688 ConstructedInterpolants, 0 QuantifiedInterpolants, 23144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 747 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 1570/1824 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((a25 == 12) || (138 < a23)) || (a25 < 11)) || (a25 == 11)) || (a4 != 1)) || (a29 < 246)) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:12:19,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE