/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 ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/threaded-sum-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:53,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:53,541 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:23:53,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:53,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:53,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:53,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:53,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:53,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:53,563 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:53,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:53,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:53,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:53,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:53,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:53,565 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:53,565 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:53,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:53,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:53,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:53,807 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:53,807 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:53,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/threaded-sum-3.wvr.bpl [2025-04-26 16:23:53,810 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/threaded-sum-3.wvr.bpl' [2025-04-26 16:23:53,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:53,829 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:53,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:53,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:53,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:53,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,861 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:53,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:53,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:53,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:53,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:53,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:53,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:53,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:53,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:53,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/1) ... [2025-04-26 16:23:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,913 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:23:53,915 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:23:53,938 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:53,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:53,938 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:53,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:53,939 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:53,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:53,939 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:53,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:53,940 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:23:53,975 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:53,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:54,076 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:54,076 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:54,098 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:54,101 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:54,101 INFO L201 PluginConnector]: Adding new model threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:54 BoogieIcfgContainer [2025-04-26 16:23:54,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:54,102 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:54,102 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:54,108 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:54,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:54,109 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:53" (1/2) ... [2025-04-26 16:23:54,110 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a7d9516 and model type threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:54, skipping insertion in model container [2025-04-26 16:23:54,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:54,110 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:54" (2/2) ... [2025-04-26 16:23:54,111 INFO L376 chiAutomizerObserver]: Analyzing ICFG threaded-sum-3.wvr.bpl [2025-04-26 16:23:54,163 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:54,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 97 flow [2025-04-26 16:23:54,219 INFO L116 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-04-26 16:23:54,223 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:54,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 5/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 23. Up to 3 conditions per place. [2025-04-26 16:23:54,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 38 transitions, 97 flow [2025-04-26 16:23:54,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 82 flow [2025-04-26 16:23:54,229 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 32 transitions, 82 flow [2025-04-26 16:23:54,237 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:54,238 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:54,238 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:54,238 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:54,238 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:54,238 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:54,238 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:54,238 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:54,239 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:54,299 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 105 [2025-04-26 16:23:54,299 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,299 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:54,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,304 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:54,304 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 137 states, but on-demand construction may add more states [2025-04-26 16:23:54,314 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 105 [2025-04-26 16:23:54,315 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,315 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:54,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,321 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L65: Formula: (= v_m_4 0) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[87] L65-->L66: Formula: (< 0 v_T_3) InVars {T=v_T_3} OutVars{T=v_T_3} AuxVars[] AssignedVars[]" "[60] L66-->L67: Formula: (< 0 v_S_3) InVars {S=v_S_3} OutVars{S=v_S_3} AuxVars[] AssignedVars[]" "[67] L67-->L68: Formula: (< 0 v_U_3) InVars {U=v_U_3} OutVars{U=v_U_3} AuxVars[] AssignedVars[]" "[74] L68-->L69: Formula: (= v_T_1 v_t_9) InVars {t=v_t_9, T=v_T_1} OutVars{t=v_t_9, T=v_T_1} AuxVars[] AssignedVars[]" "[66] L69-->L70: Formula: (= v_S_1 v_s_9) InVars {s=v_s_9, S=v_S_1} OutVars{s=v_s_9, S=v_S_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_U_1 v_u_5) InVars {u=v_u_5, U=v_U_1} OutVars{u=v_u_5, U=v_U_1} AuxVars[] AssignedVars[]" "[106] L71-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:54,322 INFO L754 eck$LassoCheckResult]: Loop: "[90] L22-1-->L22: Formula: (or (< 0 v_s_1) (< 0 v_u_1) (< 0 v_t_1)) InVars {u=v_u_1, t=v_t_1, s=v_s_1} OutVars{u=v_u_1, t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[92] L22-->L22-1: Formula: (<= v_s_5 0) InVars {s=v_s_5} OutVars{s=v_s_5} AuxVars[] AssignedVars[]" [2025-04-26 16:23:54,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1621897218, now seen corresponding path program 1 times [2025-04-26 16:23:54,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819327763] [2025-04-26 16:23:54,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:54,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:54,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:54,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:54,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-04-26 16:23:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709518402] [2025-04-26 16:23:54,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 429904832, now seen corresponding path program 1 times [2025-04-26 16:23:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638862068] [2025-04-26 16:23:54,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:54,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:54,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:54,492 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:23:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:54,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638862068] [2025-04-26 16:23:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638862068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:54,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816180930] [2025-04-26 16:23:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:54,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:23:54,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:23:54,579 INFO L87 Difference]: Start difference. First operand currently 137 states, but on-demand construction may add more states Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 4 states have internal predecessors, (10), 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:23:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:54,670 INFO L93 Difference]: Finished difference Result 186 states and 591 transitions. [2025-04-26 16:23:54,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 591 transitions. [2025-04-26 16:23:54,677 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 141 [2025-04-26 16:23:54,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 169 states and 548 transitions. [2025-04-26 16:23:54,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2025-04-26 16:23:54,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2025-04-26 16:23:54,694 INFO L74 IsDeterministic]: Start isDeterministic. Operand 169 states and 548 transitions. [2025-04-26 16:23:54,695 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:54,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 548 transitions. [2025-04-26 16:23:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 548 transitions. [2025-04-26 16:23:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-04-26 16:23:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 3.242603550295858) internal successors, (in total 548), 168 states have internal predecessors, (548), 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:23:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 548 transitions. [2025-04-26 16:23:54,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 169 states and 548 transitions. [2025-04-26 16:23:54,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:54,791 INFO L438 stractBuchiCegarLoop]: Abstraction has 169 states and 548 transitions. [2025-04-26 16:23:54,791 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:54,791 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 548 transitions. [2025-04-26 16:23:54,795 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 141 [2025-04-26 16:23:54,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,795 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:54,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,799 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L65: Formula: (= v_m_4 0) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[87] L65-->L66: Formula: (< 0 v_T_3) InVars {T=v_T_3} OutVars{T=v_T_3} AuxVars[] AssignedVars[]" "[60] L66-->L67: Formula: (< 0 v_S_3) InVars {S=v_S_3} OutVars{S=v_S_3} AuxVars[] AssignedVars[]" "[67] L67-->L68: Formula: (< 0 v_U_3) InVars {U=v_U_3} OutVars{U=v_U_3} AuxVars[] AssignedVars[]" "[74] L68-->L69: Formula: (= v_T_1 v_t_9) InVars {t=v_t_9, T=v_T_1} OutVars{t=v_t_9, T=v_T_1} AuxVars[] AssignedVars[]" "[66] L69-->L70: Formula: (= v_S_1 v_s_9) InVars {s=v_s_9, S=v_S_1} OutVars{s=v_s_9, S=v_S_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_U_1 v_u_5) InVars {u=v_u_5, U=v_U_1} OutVars{u=v_u_5, U=v_U_1} AuxVars[] AssignedVars[]" "[106] L71-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[109] L71-1-->L39-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:23:54,799 INFO L754 eck$LassoCheckResult]: Loop: "[95] L39-1-->L39: Formula: (or (< 0 v_t_3) (< 0 v_u_3)) InVars {u=v_u_3, t=v_t_3} OutVars{u=v_u_3, t=v_t_3} AuxVars[] AssignedVars[]" "[97] L39-->L39-1: Formula: (<= v_t_7 0) InVars {t=v_t_7} OutVars{t=v_t_7} AuxVars[] AssignedVars[]" [2025-04-26 16:23:54,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1260793903, now seen corresponding path program 1 times [2025-04-26 16:23:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896157411] [2025-04-26 16:23:54,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:54,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:54,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:54,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:54,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 16:23:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855902512] [2025-04-26 16:23:54,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash 442166353, now seen corresponding path program 1 times [2025-04-26 16:23:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985824706] [2025-04-26 16:23:54,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:54,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:54,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:54,866 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:23:54,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:54,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985824706] [2025-04-26 16:23:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985824706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022717608] [2025-04-26 16:23:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:23:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:23:54,891 INFO L87 Difference]: Start difference. First operand 169 states and 548 transitions. cyclomatic complexity: 422 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 4 states have internal predecessors, (11), 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:23:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:54,944 INFO L93 Difference]: Finished difference Result 215 states and 700 transitions. [2025-04-26 16:23:54,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 700 transitions. [2025-04-26 16:23:54,946 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 177 [2025-04-26 16:23:54,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 215 states and 700 transitions. [2025-04-26 16:23:54,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2025-04-26 16:23:54,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2025-04-26 16:23:54,950 INFO L74 IsDeterministic]: Start isDeterministic. Operand 215 states and 700 transitions. [2025-04-26 16:23:54,954 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:54,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 215 states and 700 transitions. [2025-04-26 16:23:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 700 transitions. [2025-04-26 16:23:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-04-26 16:23:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 3.255813953488372) internal successors, (in total 700), 214 states have internal predecessors, (700), 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:23:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 700 transitions. [2025-04-26 16:23:54,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 215 states and 700 transitions. [2025-04-26 16:23:54,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:54,968 INFO L438 stractBuchiCegarLoop]: Abstraction has 215 states and 700 transitions. [2025-04-26 16:23:54,968 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:54,968 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 700 transitions. [2025-04-26 16:23:54,970 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 177 [2025-04-26 16:23:54,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:54,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:54,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:54,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:54,971 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L65: Formula: (= v_m_4 0) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[87] L65-->L66: Formula: (< 0 v_T_3) InVars {T=v_T_3} OutVars{T=v_T_3} AuxVars[] AssignedVars[]" "[60] L66-->L67: Formula: (< 0 v_S_3) InVars {S=v_S_3} OutVars{S=v_S_3} AuxVars[] AssignedVars[]" "[67] L67-->L68: Formula: (< 0 v_U_3) InVars {U=v_U_3} OutVars{U=v_U_3} AuxVars[] AssignedVars[]" "[74] L68-->L69: Formula: (= v_T_1 v_t_9) InVars {t=v_t_9, T=v_T_1} OutVars{t=v_t_9, T=v_T_1} AuxVars[] AssignedVars[]" "[66] L69-->L70: Formula: (= v_S_1 v_s_9) InVars {s=v_s_9, S=v_S_1} OutVars{s=v_s_9, S=v_S_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_U_1 v_u_5) InVars {u=v_u_5, U=v_U_1} OutVars{u=v_u_5, U=v_U_1} AuxVars[] AssignedVars[]" "[106] L71-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[90] L22-1-->L22: Formula: (or (< 0 v_s_1) (< 0 v_u_1) (< 0 v_t_1)) InVars {u=v_u_1, t=v_t_1, s=v_s_1} OutVars{u=v_u_1, t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[93] L22-->L22-1: Formula: (and (< 0 v_s_15) (= v_s_15 (+ v_s_14 1)) (= (+ v_m_10 1) v_m_9)) InVars {m=v_m_10, s=v_s_15} OutVars{m=v_m_9, s=v_s_14} AuxVars[] AssignedVars[m, s]" [2025-04-26 16:23:54,971 INFO L754 eck$LassoCheckResult]: Loop: "[90] L22-1-->L22: Formula: (or (< 0 v_s_1) (< 0 v_u_1) (< 0 v_t_1)) InVars {u=v_u_1, t=v_t_1, s=v_s_1} OutVars{u=v_u_1, t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[92] L22-->L22-1: Formula: (<= v_s_5 0) InVars {s=v_s_5} OutVars{s=v_s_5} AuxVars[] AssignedVars[]" [2025-04-26 16:23:54,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 429904833, now seen corresponding path program 1 times [2025-04-26 16:23:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050638397] [2025-04-26 16:23:54,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:54,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:54,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:54,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:54,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:54,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 2 times [2025-04-26 16:23:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:54,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262656273] [2025-04-26 16:23:54,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:54,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:54,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:54,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:54,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:54,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:54,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:54,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:54,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 821686979, now seen corresponding path program 1 times [2025-04-26 16:23:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:55,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743567243] [2025-04-26 16:23:55,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:55,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:55,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:55,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:55,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:55,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:55,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:55,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:55,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:55,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:55,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:55,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:55,206 INFO L201 PluginConnector]: Adding new model threaded-sum-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:55 BoogieIcfgContainer [2025-04-26 16:23:55,206 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:55,207 INFO L158 Benchmark]: Toolchain (without parser) took 1377.79ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.1MB in the beginning and 81.9MB in the end (delta: 4.2MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. [2025-04-26 16:23:55,207 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:55,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.89ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:55,208 INFO L158 Benchmark]: Boogie Preprocessor took 23.47ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 962.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:55,208 INFO L158 Benchmark]: RCFGBuilder took 214.07ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 73.0MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:23:55,208 INFO L158 Benchmark]: BuchiAutomizer took 1104.27ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.9MB in the beginning and 81.9MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:55,209 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.68ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.89ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.47ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 962.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 214.07ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 73.0MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1104.27ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.9MB in the beginning and 81.9MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 35 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 215 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L64] 0 assume m == 0; VAL [m=0] [L65] 0 assume 0 < T; VAL [T=1, m=0] [L66] 0 assume 0 < S; VAL [S=1, T=1, m=0] [L67] 0 assume 0 < U; VAL [S=1, T=1, U=1, m=0] [L68] 0 assume t == T; VAL [S=1, T=1, U=1, m=0, t=1] [L69] 0 assume s == S; VAL [S=1, T=1, U=1, m=0, s=1, t=1] [L70] 0 assume u == U; VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L71] FORK 0 fork 1 thread1(); VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L21] COND TRUE 1 0 < s || 0 < t || 0 < u VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L24] 1 assume 0 < s; [L25] 1 s := s - 1; [L26] 1 m := m + 1; VAL [S=1, T=1, U=1, m=1, s=0, t=1, u=1] Loop: [L21] COND TRUE 0 < s || 0 < t || 0 < u [L30] assume !(0 < s); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L64] 0 assume m == 0; VAL [m=0] [L65] 0 assume 0 < T; VAL [T=1, m=0] [L66] 0 assume 0 < S; VAL [S=1, T=1, m=0] [L67] 0 assume 0 < U; VAL [S=1, T=1, U=1, m=0] [L68] 0 assume t == T; VAL [S=1, T=1, U=1, m=0, t=1] [L69] 0 assume s == S; VAL [S=1, T=1, U=1, m=0, s=1, t=1] [L70] 0 assume u == U; VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L71] FORK 0 fork 1 thread1(); VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L21] COND TRUE 1 0 < s || 0 < t || 0 < u VAL [S=1, T=1, U=1, m=0, s=1, t=1, u=1] [L24] 1 assume 0 < s; [L25] 1 s := s - 1; [L26] 1 m := m + 1; VAL [S=1, T=1, U=1, m=1, s=0, t=1, u=1] Loop: [L21] COND TRUE 0 < s || 0 < t || 0 < u [L30] assume !(0 < s); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:23:55,227 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...