/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/interleaved3-buggy.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:37,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:37,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:37,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:37,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:37,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:37,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:37,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:37,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:37,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:37,621 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:37,621 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:37,621 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:37,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:37,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:37,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:37,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:37,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:37,624 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:37,624 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:37,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:37,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:37,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:37,844 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:37,844 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:37,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/interleaved3-buggy.c.bpl [2025-04-26 16:24:37,845 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/interleaved3-buggy.c.bpl' [2025-04-26 16:24:37,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:37,858 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:37,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:37,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:37,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:37,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,881 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:37,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:37,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:37,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:37,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:37,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:37,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:37,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:37,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:37,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/1) ... [2025-04-26 16:24:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:37,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:37,944 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:37,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:37,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:37,945 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:37,945 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:37,945 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:37,945 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:37,978 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:37,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:38,052 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:38,052 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:38,069 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:38,069 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:38,069 INFO L201 PluginConnector]: Adding new model interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:38 BoogieIcfgContainer [2025-04-26 16:24:38,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:38,070 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:38,070 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:38,074 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:38,074 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:38,074 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:37" (1/2) ... [2025-04-26 16:24:38,075 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c413b78 and model type interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:38, skipping insertion in model container [2025-04-26 16:24:38,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:38,075 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:38" (2/2) ... [2025-04-26 16:24:38,076 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved3-buggy.c.bpl [2025-04-26 16:24:38,130 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:38,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-04-26 16:24:38,180 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-26 16:24:38,182 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:38,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 3/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 48 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-26 16:24:38,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-04-26 16:24:38,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 68 flow [2025-04-26 16:24:38,190 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 25 transitions, 68 flow [2025-04-26 16:24:38,200 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:38,200 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:38,201 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:38,201 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:38,201 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:38,201 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:38,201 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:38,202 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:38,203 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:38,269 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 237 [2025-04-26 16:24:38,269 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:38,269 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:38,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:38,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:38,273 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:38,274 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 260 states, but on-demand construction may add more states [2025-04-26 16:24:38,283 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 237 [2025-04-26 16:24:38,284 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:38,284 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:38,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:38,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:38,290 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L14: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x2_5 0)) InVars {x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5} OutVars{x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5} AuxVars[] AssignedVars[]" "[87] L14-->L29-1: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 16:24:38,291 INFO L754 eck$LassoCheckResult]: Loop: "[66] L29-1-->L27: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[68] L27-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[69] L28-->L29: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[70] L29-->L29-1: Formula: (and (= v_f1_4 0) (< 0 v_f1_5)) InVars {f1=v_f1_5} OutVars{f1=v_f1_4} AuxVars[] AssignedVars[f1]" [2025-04-26 16:24:38,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2939, now seen corresponding path program 1 times [2025-04-26 16:24:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:38,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807574502] [2025-04-26 16:24:38,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:38,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:38,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:38,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:38,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:38,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:38,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:38,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:38,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2957284, now seen corresponding path program 1 times [2025-04-26 16:24:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:38,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340517871] [2025-04-26 16:24:38,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:38,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:38,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:38,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:38,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:38,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:38,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1578705314, now seen corresponding path program 1 times [2025-04-26 16:24:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:38,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156483369] [2025-04-26 16:24:38,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:38,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:38,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156483369] [2025-04-26 16:24:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156483369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:24:38,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296677356] [2025-04-26 16:24:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:38,501 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:38,501 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:38,501 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:38,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:38,502 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:38,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:38,502 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:38,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:38,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:38,502 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:38,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,582 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:38,584 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:38,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:38,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:38,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:38,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:38,605 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:38,605 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:38,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:38,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:38,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:38,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:38,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:38,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:38,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:38,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:38,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:38,640 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:38,665 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:38,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:38,670 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:38,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:38,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:38,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:38,670 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:38,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:38,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:38,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:38,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:38,670 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:38,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,758 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:38,777 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:38,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:38,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:38,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:38,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:38,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:38,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:38,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:38,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:38,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:38,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:38,800 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:38,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:38,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:38,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:38,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:38,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:38,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:38,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:38,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:38,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:38,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:38,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:38,824 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:38,827 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:38,827 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:38,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:38,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:38,833 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:38,836 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:38,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:38,837 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:38,837 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:38,838 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f1) = 1*f1 Supporting invariants [] [2025-04-26 16:24:38,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:38,847 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:38,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:38,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:38,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:38,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:38,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:38,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:38,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:38,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:38,952 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:24:38,958 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 260 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,034 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 260 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 664 states and 2143 transitions. Complement of second has 4 states. [2025-04-26 16:24:39,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-26 16:24:39,048 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:39,048 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,049 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:24:39,049 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,049 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:24:39,049 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 2143 transitions. [2025-04-26 16:24:39,062 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 209 [2025-04-26 16:24:39,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 489 states and 1582 transitions. [2025-04-26 16:24:39,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2025-04-26 16:24:39,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 325 [2025-04-26 16:24:39,074 INFO L74 IsDeterministic]: Start isDeterministic. Operand 489 states and 1582 transitions. [2025-04-26 16:24:39,075 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:39,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 489 states and 1582 transitions. [2025-04-26 16:24:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states and 1582 transitions. [2025-04-26 16:24:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 393. [2025-04-26 16:24:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 393 states have (on average 3.2111959287531806) internal successors, (in total 1262), 392 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1262 transitions. [2025-04-26 16:24:39,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 393 states and 1262 transitions. [2025-04-26 16:24:39,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:39,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:39,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:39,125 INFO L87 Difference]: Start difference. First operand 393 states and 1262 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:39,147 INFO L93 Difference]: Finished difference Result 360 states and 1000 transitions. [2025-04-26 16:24:39,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 360 states and 1000 transitions. [2025-04-26 16:24:39,153 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 209 [2025-04-26 16:24:39,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 360 states to 229 states and 641 transitions. [2025-04-26 16:24:39,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2025-04-26 16:24:39,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2025-04-26 16:24:39,157 INFO L74 IsDeterministic]: Start isDeterministic. Operand 229 states and 641 transitions. [2025-04-26 16:24:39,158 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:39,158 INFO L218 hiAutomatonCegarLoop]: Abstraction has 229 states and 641 transitions. [2025-04-26 16:24:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 641 transitions. [2025-04-26 16:24:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-04-26 16:24:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 2.7991266375545854) internal successors, (in total 641), 228 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 641 transitions. [2025-04-26 16:24:39,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 229 states and 641 transitions. [2025-04-26 16:24:39,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:39,170 INFO L438 stractBuchiCegarLoop]: Abstraction has 229 states and 641 transitions. [2025-04-26 16:24:39,170 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:39,170 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 641 transitions. [2025-04-26 16:24:39,171 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 209 [2025-04-26 16:24:39,171 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:39,171 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:39,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:39,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:24:39,172 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L14: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x2_5 0)) InVars {x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5} OutVars{x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5} AuxVars[] AssignedVars[]" "[87] L14-->L29-1: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[90] L14-1-->L40: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" [2025-04-26 16:24:39,172 INFO L754 eck$LassoCheckResult]: Loop: "[72] L40-->L42: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[74] L42-->L42-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[75] L42-1-->L48: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[76] L48-->L40: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" [2025-04-26 16:24:39,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash 91199, now seen corresponding path program 1 times [2025-04-26 16:24:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287903357] [2025-04-26 16:24:39,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:39,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:39,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:39,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:39,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 3141988, now seen corresponding path program 1 times [2025-04-26 16:24:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83251019] [2025-04-26 16:24:39,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1672935774, now seen corresponding path program 1 times [2025-04-26 16:24:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921556212] [2025-04-26 16:24:39,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:39,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:39,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:39,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:39,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921556212] [2025-04-26 16:24:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921556212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:39,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010732233] [2025-04-26 16:24:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:39,266 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:39,267 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:39,267 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:39,267 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:39,267 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:39,267 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,267 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:39,267 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:39,267 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:39,267 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:39,267 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:39,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,303 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:39,303 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:39,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:39,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:39,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:39,317 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:39,318 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f3=1} Honda state: {f3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:39,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:24:39,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,325 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:39,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:39,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:39,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:39,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,344 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:39,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:39,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:39,372 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:39,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:24:39,376 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:39,376 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:39,376 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:39,376 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:39,376 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:39,376 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,376 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:39,376 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:39,376 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:39,376 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:39,377 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:39,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,428 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:39,429 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,432 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:39,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:39,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:39,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:39,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:39,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:39,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:39,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:39,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:39,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:39,451 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:39,451 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,452 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:39,455 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:39,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:39,459 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:39,459 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:39,459 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-04-26 16:24:39,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:39,466 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:39,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:39,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:39,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:39,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:39,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:39,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:39,528 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:39,528 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 641 transitions. cyclomatic complexity: 454 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,556 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 229 states and 641 transitions. cyclomatic complexity: 454. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 630 states and 1825 transitions. Complement of second has 5 states. [2025-04-26 16:24:39,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-26 16:24:39,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:39,558 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:24:39,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,559 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:24:39,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 630 states and 1825 transitions. [2025-04-26 16:24:39,566 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 159 [2025-04-26 16:24:39,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 630 states to 485 states and 1408 transitions. [2025-04-26 16:24:39,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2025-04-26 16:24:39,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2025-04-26 16:24:39,574 INFO L74 IsDeterministic]: Start isDeterministic. Operand 485 states and 1408 transitions. [2025-04-26 16:24:39,574 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:39,574 INFO L218 hiAutomatonCegarLoop]: Abstraction has 485 states and 1408 transitions. [2025-04-26 16:24:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 1408 transitions. [2025-04-26 16:24:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 388. [2025-04-26 16:24:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 388 states have (on average 2.935567010309278) internal successors, (in total 1139), 387 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1139 transitions. [2025-04-26 16:24:39,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 388 states and 1139 transitions. [2025-04-26 16:24:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:39,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:39,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:39,584 INFO L87 Difference]: Start difference. First operand 388 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:39,603 INFO L93 Difference]: Finished difference Result 277 states and 662 transitions. [2025-04-26 16:24:39,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 277 states and 662 transitions. [2025-04-26 16:24:39,607 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 123 [2025-04-26 16:24:39,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 277 states to 181 states and 433 transitions. [2025-04-26 16:24:39,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2025-04-26 16:24:39,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2025-04-26 16:24:39,610 INFO L74 IsDeterministic]: Start isDeterministic. Operand 181 states and 433 transitions. [2025-04-26 16:24:39,611 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:39,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 433 transitions. [2025-04-26 16:24:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 433 transitions. [2025-04-26 16:24:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 143. [2025-04-26 16:24:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 2.4825174825174825) internal successors, (in total 355), 142 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 355 transitions. [2025-04-26 16:24:39,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 143 states and 355 transitions. [2025-04-26 16:24:39,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:39,616 INFO L438 stractBuchiCegarLoop]: Abstraction has 143 states and 355 transitions. [2025-04-26 16:24:39,616 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:39,616 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 355 transitions. [2025-04-26 16:24:39,617 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 99 [2025-04-26 16:24:39,617 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:39,617 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:39,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:39,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:39,619 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L14: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x2_5 0)) InVars {x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5} OutVars{x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5} AuxVars[] AssignedVars[]" "[87] L14-->L29-1: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[90] L14-1-->L40: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[84] L15-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:39,619 INFO L754 eck$LassoCheckResult]: Loop: "[78] L55-->L57: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[80] L57-->L57-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[81] L57-1-->L55: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:39,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2827253, now seen corresponding path program 1 times [2025-04-26 16:24:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296909177] [2025-04-26 16:24:39,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2025-04-26 16:24:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838302015] [2025-04-26 16:24:39,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:39,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:39,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:39,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:39,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1672574278, now seen corresponding path program 1 times [2025-04-26 16:24:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193506381] [2025-04-26 16:24:39,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:39,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:39,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:39,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:39,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193506381] [2025-04-26 16:24:39,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193506381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:39,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:39,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281430417] [2025-04-26 16:24:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:39,692 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:39,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:39,692 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:39,692 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:39,692 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:39,692 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,692 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:39,692 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:39,692 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3-buggy.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:39,692 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:39,692 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:39,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,723 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:39,723 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:39,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,725 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:39,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:39,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:39,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:24:39,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,749 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:24:39,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:39,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:39,774 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:39,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:24:39,780 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:39,780 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:39,780 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:39,780 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:39,780 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:39,780 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,780 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:39,780 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:39,780 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3-buggy.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:39,780 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:39,780 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:39,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,808 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:39,808 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:39,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:39,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:39,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:39,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:39,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:39,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:39,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:39,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:39,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:39,825 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:39,827 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:39,827 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:39,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,829 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:39,831 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:39,834 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:39,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:39,834 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:39,834 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:39,834 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f3) = 1*f3 Supporting invariants [] [2025-04-26 16:24:39,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:39,840 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:39,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:39,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:39,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:39,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:39,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:39,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:39,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:39,882 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:39,882 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 355 transitions. cyclomatic complexity: 247 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,899 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 355 transitions. cyclomatic complexity: 247. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 409 states and 1109 transitions. Complement of second has 5 states. [2025-04-26 16:24:39,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-26 16:24:39,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:24:39,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:24:39,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:24:39,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:39,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 1109 transitions. [2025-04-26 16:24:39,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:24:39,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 153 states and 359 transitions. [2025-04-26 16:24:39,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-04-26 16:24:39,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2025-04-26 16:24:39,904 INFO L74 IsDeterministic]: Start isDeterministic. Operand 153 states and 359 transitions. [2025-04-26 16:24:39,904 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:39,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 359 transitions. [2025-04-26 16:24:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 359 transitions. [2025-04-26 16:24:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2025-04-26 16:24:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 2.475) internal successors, (in total 297), 119 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 297 transitions. [2025-04-26 16:24:39,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 297 transitions. [2025-04-26 16:24:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:39,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:39,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:39,907 INFO L87 Difference]: Start difference. First operand 120 states and 297 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:39,917 INFO L93 Difference]: Finished difference Result 93 states and 190 transitions. [2025-04-26 16:24:39,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 190 transitions. [2025-04-26 16:24:39,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:39,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 0 states and 0 transitions. [2025-04-26 16:24:39,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:39,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:39,918 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:39,918 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:39,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:39,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:39,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:39,920 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:39,920 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:39,920 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:39,920 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:39,920 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:39,926 INFO L201 PluginConnector]: Adding new model interleaved3-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:39 BoogieIcfgContainer [2025-04-26 16:24:39,926 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:39,926 INFO L158 Benchmark]: Toolchain (without parser) took 2068.75ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 84.5MB in the beginning and 30.5MB in the end (delta: 54.0MB). Peak memory consumption was 51.8MB. Max. memory is 8.0GB. [2025-04-26 16:24:39,928 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:39,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.72ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:39,928 INFO L158 Benchmark]: Boogie Preprocessor took 15.88ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:39,929 INFO L158 Benchmark]: RCFGBuilder took 170.94ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 72.1MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:24:39,929 INFO L158 Benchmark]: BuchiAutomizer took 1855.79ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.9MB in the beginning and 30.5MB in the end (delta: 41.4MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:39,930 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.72ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.88ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 170.94ms. Allocated memory is still 159.4MB. Free memory was 81.5MB in the beginning and 72.1MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1855.79ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.9MB in the beginning and 30.5MB in the end (delta: 41.4MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 264 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 102 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function f1 and consists of 3 locations. One deterministic module has affine ranking function f2 and consists of 3 locations. One deterministic module has affine ranking function f3 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:39,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...