/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:21:55,756 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:21:55,815 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:21:55,837 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:21:55,838 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:21:55,838 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:21:55,840 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:21:55,840 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:21:55,840 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:21:55,843 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:21:55,843 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:21:55,844 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:21:55,844 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:21:55,845 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:21:55,845 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:21:55,845 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:21:55,845 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:21:55,846 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:21:55,846 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:21:55,846 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:21:55,846 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:21:55,846 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:21:55,847 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:21:55,847 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:21:55,847 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:21:55,847 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:21:55,847 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:21:55,847 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:21:55,847 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:21:55,848 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:21:55,848 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:21:55,849 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:21:55,849 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:21:55,850 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:21:55,850 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:21:56,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:21:56,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:21:56,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:21:56,058 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:21:56,059 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:21:56,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl [2023-10-12 17:21:56,060 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl' [2023-10-12 17:21:56,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:21:56,077 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:21:56,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:21:56,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:21:56,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:21:56,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,095 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:21:56,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:21:56,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:21:56,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:21:56,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:21:56,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:21:56,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:21:56,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:21:56,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:21:56,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/1) ... [2023-10-12 17:21:56,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:56,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:56,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:56,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:21:56,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:21:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:21:56,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:21:56,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:21:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:21:56,180 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:21:56,180 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:21:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:21:56,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:21:56,181 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:21:56,221 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:21:56,223 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:21:56,343 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:21:56,365 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:21:56,365 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:21:56,365 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2023-10-12 17:21:56,366 WARN L332 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2023-10-12 17:21:56,367 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:21:56 BoogieIcfgContainer [2023-10-12 17:21:56,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:21:56,368 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:21:56,368 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:21:56,376 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:21:56,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:21:56,376 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:21:56" (1/2) ... [2023-10-12 17:21:56,378 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa75793 and model type loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:21:56, skipping insertion in model container [2023-10-12 17:21:56,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:21:56,378 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:21:56" (2/2) ... [2023-10-12 17:21:56,379 INFO L332 chiAutomizerObserver]: Analyzing ICFG loop-tiling-eq.wvr.bpl [2023-10-12 17:21:56,446 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:21:56,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 20 transitions, 56 flow [2023-10-12 17:21:56,490 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:21:56,490 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:21:56,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 3/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:21:56,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 20 transitions, 56 flow [2023-10-12 17:21:56,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2023-10-12 17:21:56,503 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:21:56,524 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 44 flow [2023-10-12 17:21:56,527 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 44 flow [2023-10-12 17:21:56,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2023-10-12 17:21:56,533 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:21:56,533 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:21:56,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 3/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:21:56,534 INFO L119 LiptonReduction]: Number of co-enabled transitions 46 [2023-10-12 17:21:56,625 INFO L134 LiptonReduction]: Checked pairs total: 30 [2023-10-12 17:21:56,625 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:21:56,636 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:21:56,636 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:21:56,636 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:21:56,636 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:21:56,636 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:21:56,636 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:21:56,636 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:21:56,637 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:21:56,637 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:21:56,640 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:56,641 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:21:56,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:21:56,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:56,646 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:21:56,646 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:21:56,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:56,647 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:21:56,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:21:56,647 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:56,651 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 30#[L26, L62]true [2023-10-12 17:21:56,652 INFO L750 eck$LassoCheckResult]: Loop: 30#[L26, L62]true [62] L26-->L26: Formula: (and (= (store v_A_9 v_x_14 (select v_F_9 v_x_14)) v_A_8) (< v_x_14 v_L_6) (= v_x_13 (+ v_x_14 1))) InVars {A=v_A_9, x=v_x_14, F=v_F_9, L=v_L_6} OutVars{A=v_A_8, x=v_x_13, F=v_F_9, L=v_L_6} AuxVars[] AssignedVars[A, x] 30#[L26, L62]true [2023-10-12 17:21:56,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash 3191, now seen corresponding path program 1 times [2023-10-12 17:21:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825432318] [2023-10-12 17:21:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:56,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:56,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:56,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2023-10-12 17:21:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65178934] [2023-10-12 17:21:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:56,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:56,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:56,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 98983, now seen corresponding path program 1 times [2023-10-12 17:21:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:56,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253565868] [2023-10-12 17:21:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:56,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:56,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:56,871 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:56,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:56,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:56,872 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:56,872 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:21:56,872 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:56,872 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:56,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:56,872 INFO L133 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:21:56,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:56,872 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:56,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:56,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:56,949 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:56,953 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:21:56,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:56,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:56,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:56,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:21:56,959 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 [2023-10-12 17:21:56,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:56,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:21:56,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:56,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:56,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:56,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:21:56,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:21:56,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:56,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:56,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:56,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:21:56,999 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 [2023-10-12 17:21:57,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:57,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:21:57,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:57,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:57,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:57,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:21:57,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:21:57,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:57,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:21:57,031 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 [2023-10-12 17:21:57,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:57,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:57,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:57,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:57,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:57,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:57,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:21:57,059 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:21:57,059 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:21:57,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:21:57,065 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:21:57,072 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:21:57,073 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:21:57,073 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, L) = -1*x + 1*L Supporting invariants [] [2023-10-12 17:21:57,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:21:57,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:57,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:21:57,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:57,116 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:21:57,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:21:57,145 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 [2023-10-12 17:21:57,146 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:57,205 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 151 transitions. [2023-10-12 17:21:57,206 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:21:57,208 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:21:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:21:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2023-10-12 17:21:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:21:57,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:21:57,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:21:57,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 184 transitions, 904 flow [2023-10-12 17:21:57,230 INFO L124 PetriNetUnfolderBase]: 87/148 cut-off events. [2023-10-12 17:21:57,231 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-10-12 17:21:57,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 148 events. 87/148 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 423 event pairs, 4 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2023-10-12 17:21:57,231 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 30 places, 184 transitions, 904 flow [2023-10-12 17:21:57,234 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 30 places, 184 transitions, 904 flow [2023-10-12 17:21:57,234 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 184 transitions, 904 flow [2023-10-12 17:21:57,234 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:21:57,234 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 184 transitions, 904 flow [2023-10-12 17:21:57,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:57,239 INFO L124 PetriNetUnfolderBase]: 21/39 cut-off events. [2023-10-12 17:21:57,239 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:21:57,240 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:57,240 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [2023-10-12 17:21:57,240 INFO L750 eck$LassoCheckResult]: Loop: 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [2023-10-12 17:21:57,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash 99387, now seen corresponding path program 1 times [2023-10-12 17:21:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28527528] [2023-10-12 17:21:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:57,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:57,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:57,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash 3012, now seen corresponding path program 1 times [2023-10-12 17:21:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:57,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508079038] [2023-10-12 17:21:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:57,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:57,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:57,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash 95512958, now seen corresponding path program 1 times [2023-10-12 17:21:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:57,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658729204] [2023-10-12 17:21:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:57,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:57,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:57,277 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:57,278 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:57,278 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:57,278 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:57,278 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:21:57,278 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,278 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:57,278 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:57,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:21:57,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:57,278 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:57,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:57,281 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:57,283 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:57,304 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:57,305 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:21:57,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:21:57,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:21:57,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:21:57,319 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:21:57,319 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {j=0} Honda state: {j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:21:57,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:21:57,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:21:57,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:21:57,341 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:21:57,341 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {M=0} Honda state: {M=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:21:57,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:21:57,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:21:57,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:21:57,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:21:57,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:21:57,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:21:57,479 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:21:57,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:21:57,483 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:57,483 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:57,483 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:57,483 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:57,483 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:21:57,483 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:57,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:57,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:21:57,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:57,483 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:57,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:57,487 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:57,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:57,522 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:57,522 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:21:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:21:57,549 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 [2023-10-12 17:21:57,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:57,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:21:57,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:57,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:57,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:57,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:21:57,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:21:57,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:57,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:21:57,576 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 [2023-10-12 17:21:57,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:57,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:21:57,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:57,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:57,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:57,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:21:57,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:21:57,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:57,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,605 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,609 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 [2023-10-12 17:21:57,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:21:57,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:57,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:21:57,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:57,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:57,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:57,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:21:57,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:21:57,630 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:21:57,633 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:21:57,633 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:21:57,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:57,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,635 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:21:57,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:21:57,637 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:21:57,637 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:21:57,637 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:21:57,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,641 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:21:57,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:57,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:21:57,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:57,666 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:21:57,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:21:57,683 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 [2023-10-12 17:21:57,683 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:57,745 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 193 transitions. [2023-10-12 17:21:57,746 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:21:57,758 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:21:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:21:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2023-10-12 17:21:57,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:21:57,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:57,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:21:57,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:57,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:21:57,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:57,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 3112 transitions, 21696 flow [2023-10-12 17:21:57,856 INFO L124 PetriNetUnfolderBase]: 241/394 cut-off events. [2023-10-12 17:21:57,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,861 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-10-12 17:21:57,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 394 events. 241/394 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1550 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 1005. Up to 141 conditions per place. [2023-10-12 17:21:57,867 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 3112 transitions, 21696 flow [2023-10-12 17:21:57,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:57,903 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 3112 transitions, 21696 flow [2023-10-12 17:21:57,903 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 3112 transitions, 21696 flow [2023-10-12 17:21:57,903 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:21:57,904 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 3112 transitions, 21696 flow [2023-10-12 17:21:57,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:21:57,955 INFO L124 PetriNetUnfolderBase]: 155/245 cut-off events. [2023-10-12 17:21:57,955 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-10-12 17:21:57,955 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:21:57,956 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [61] L26-->thread1EXIT: Formula: (<= v_L_4 v_x_11) InVars {L=v_L_4, x=v_x_11} OutVars{L=v_L_4, x=v_x_11} AuxVars[] AssignedVars[] 139#[L45, L63, thread1EXIT]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 139#[L45, L63, thread1EXIT]true [2023-10-12 17:21:57,956 INFO L750 eck$LassoCheckResult]: Loop: 139#[L45, L63, thread1EXIT]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 139#[L45, L63, thread1EXIT]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 139#[L45, L63, thread1EXIT]true [2023-10-12 17:21:57,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1593519332, now seen corresponding path program 1 times [2023-10-12 17:21:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:57,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399058310] [2023-10-12 17:21:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:57,965 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:21:57,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496529811] [2023-10-12 17:21:57,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:57,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:21:57,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:57,966 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:21:57,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-10-12 17:21:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:57,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:58,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:58,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 1 times [2023-10-12 17:21:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636445545] [2023-10-12 17:21:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:58,005 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:21:58,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561578141] [2023-10-12 17:21:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:58,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:21:58,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,006 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-10-12 17:21:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:58,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:58,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:58,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1931244508, now seen corresponding path program 2 times [2023-10-12 17:21:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:21:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291004084] [2023-10-12 17:21:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:21:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:21:58,056 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:21:58,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216582277] [2023-10-12 17:21:58,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:21:58,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:21:58,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,059 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-10-12 17:21:58,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:21:58,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:21:58,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:21:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:21:58,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:21:58,205 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:21:58,205 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:21:58,206 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:21:58,206 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:21:58,206 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:21:58,206 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:58,206 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:21:58,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:21:58,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: loop-tiling-eq.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:21:58,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:21:58,206 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:21:58,207 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:58,210 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:58,212 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:58,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:58,216 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:58,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:58,272 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:21:58,353 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:21:58,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:21:58,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:58,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,356 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:21:58,359 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 [2023-10-12 17:21:58,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:58,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:58,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:58,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:58,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:58,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:58,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:58,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:58,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,387 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:21:58,390 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 [2023-10-12 17:21:58,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:58,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:58,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:58,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:58,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:58,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:58,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:58,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-10-12 17:21:58,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:58,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,419 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:21:58,422 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 [2023-10-12 17:21:58,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:58,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:58,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:58,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:58,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:58,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:58,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:58,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:58,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,445 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:21:58,449 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 [2023-10-12 17:21:58,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:58,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:58,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:58,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:58,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:58,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:58,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:21:58,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:21:58,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:58,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,472 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:21:58,475 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 [2023-10-12 17:21:58,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:21:58,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:21:58,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:21:58,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:21:58,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:21:58,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:21:58,499 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:21:58,506 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:21:58,506 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:21:58,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:21:58,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:21:58,509 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:21:58,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:21:58,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:21:58,528 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:21:58,528 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:21:58,528 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:21:58,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-10-12 17:21:58,537 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:21:58,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:21:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:58,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:21:58,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:21:58,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:21:58,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:21:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:21:58,581 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 [2023-10-12 17:21:58,581 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:58,628 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 151 transitions. [2023-10-12 17:21:58,628 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:21:58,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:21:58,955 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:21:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:21:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:21:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2023-10-12 17:21:58,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:21:58,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:58,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:21:58,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:58,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:21:58,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:21:58,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 41072 transitions, 370912 flow [2023-10-12 17:22:01,266 INFO L124 PetriNetUnfolderBase]: 804/1361 cut-off events. [2023-10-12 17:22:01,266 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2023-10-12 17:22:01,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 1361 events. 804/1361 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7077 event pairs, 0 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 5070. Up to 518 conditions per place. [2023-10-12 17:22:01,268 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 58 places, 41072 transitions, 370912 flow [2023-10-12 17:22:01,708 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 58 places, 41072 transitions, 370912 flow [2023-10-12 17:22:01,708 INFO L430 stractBuchiCegarLoop]: Abstraction has has 58 places, 41072 transitions, 370912 flow [2023-10-12 17:22:01,708 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:22:01,708 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 58 places, 41072 transitions, 370912 flow [2023-10-12 17:22:03,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:22:03,164 INFO L124 PetriNetUnfolderBase]: 499/800 cut-off events. [2023-10-12 17:22:03,164 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-10-12 17:22:03,165 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:22:03,165 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [2023-10-12 17:22:03,165 INFO L750 eck$LassoCheckResult]: Loop: 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [2023-10-12 17:22:03,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1593640602, now seen corresponding path program 1 times [2023-10-12 17:22:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:03,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932659360] [2023-10-12 17:22:03,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:03,170 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426158338] [2023-10-12 17:22:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:03,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:03,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:03,171 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:03,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-10-12 17:22:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:03,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:22:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:03,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:22:03,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 2 times [2023-10-12 17:22:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027508333] [2023-10-12 17:22:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:03,206 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737261472] [2023-10-12 17:22:03,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:22:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:03,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:03,207 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:03,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-10-12 17:22:03,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:22:03,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:22:03,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:22:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:03,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:22:03,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1814704038, now seen corresponding path program 2 times [2023-10-12 17:22:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694187534] [2023-10-12 17:22:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:03,246 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409809122] [2023-10-12 17:22:03,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:22:03,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:03,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:03,250 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:03,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-10-12 17:22:03,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:22:03,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:22:03,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:22:03,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:22:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:03,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:22:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:03,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:22:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694187534] [2023-10-12 17:22:03,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:22:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409809122] [2023-10-12 17:22:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409809122] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:22:03,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:22:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-10-12 17:22:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085593612] [2023-10-12 17:22:03,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:22:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:22:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-10-12 17:22:03,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-10-12 17:22:03,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41072 transitions, 370912 flow. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:22:03,384 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:22:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:22:13,739 INFO L124 PetriNetUnfolderBase]: 2128/3619 cut-off events. [2023-10-12 17:22:13,740 INFO L125 PetriNetUnfolderBase]: For 1017/1017 co-relation queries the response was YES. [2023-10-12 17:22:13,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18705 conditions, 3619 events. 2128/3619 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 22112 event pairs, 0 based on Foata normal form. 88/2016 useless extension candidates. Maximal degree in co-relation 12159. Up to 1489 conditions per place. [2023-10-12 17:22:13,761 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 1176 selfloop transitions, 433 changer transitions 969/2578 dead transitions. [2023-10-12 17:22:13,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 2578 transitions, 27238 flow [2023-10-12 17:22:13,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 2578 transitions, 27238 flow [2023-10-12 17:22:14,205 INFO L124 PetriNetUnfolderBase]: 2128/3619 cut-off events. [2023-10-12 17:22:14,206 INFO L125 PetriNetUnfolderBase]: For 1017/1017 co-relation queries the response was YES. [2023-10-12 17:22:14,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18705 conditions, 3619 events. 2128/3619 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 22130 event pairs, 0 based on Foata normal form. 0/1928 useless extension candidates. Maximal degree in co-relation 12159. Up to 1489 conditions per place. [2023-10-12 17:22:14,209 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 55 places, 2578 transitions, 27238 flow [2023-10-12 17:22:14,228 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 55 places, 2578 transitions, 27238 flow [2023-10-12 17:22:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-10-12 17:22:14,229 INFO L430 stractBuchiCegarLoop]: Abstraction has has 55 places, 2578 transitions, 27238 flow [2023-10-12 17:22:14,229 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:22:14,229 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 places, 2578 transitions, 27238 flow [2023-10-12 17:22:14,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:22:14,526 INFO L124 PetriNetUnfolderBase]: 1533/2579 cut-off events. [2023-10-12 17:22:14,526 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2023-10-12 17:22:14,526 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:22:14,527 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 293#[L26, L63, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:14,527 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:14,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1282384396, now seen corresponding path program 1 times [2023-10-12 17:22:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:14,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420462966] [2023-10-12 17:22:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:14,535 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167743688] [2023-10-12 17:22:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:14,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:14,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:14,538 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-10-12 17:22:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:22:14,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:22:14,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:22:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:14,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:22:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:22:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420462966] [2023-10-12 17:22:14,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:22:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167743688] [2023-10-12 17:22:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167743688] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:22:14,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:22:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-10-12 17:22:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495346824] [2023-10-12 17:22:14,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:22:14,812 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:22:14,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 3 times [2023-10-12 17:22:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:14,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180356734] [2023-10-12 17:22:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:14,814 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:14,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727825728] [2023-10-12 17:22:14,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:22:14,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:14,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:14,824 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:14,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-10-12 17:22:14,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-10-12 17:22:14,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:22:14,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:22:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:14,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:22:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:22:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-10-12 17:22:14,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-10-12 17:22:14,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 2578 transitions, 27238 flow. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:22:14,895 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:22:14,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:22:15,966 INFO L124 PetriNetUnfolderBase]: 3207/5424 cut-off events. [2023-10-12 17:22:15,967 INFO L125 PetriNetUnfolderBase]: For 1485/1485 co-relation queries the response was YES. [2023-10-12 17:22:15,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33440 conditions, 5424 events. 3207/5424 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 34640 event pairs, 5 based on Foata normal form. 13/2892 useless extension candidates. Maximal degree in co-relation 21842. Up to 2596 conditions per place. [2023-10-12 17:22:15,993 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 1722 selfloop transitions, 693 changer transitions 1442/3857 dead transitions. [2023-10-12 17:22:15,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 3857 transitions, 48432 flow [2023-10-12 17:22:15,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 3857 transitions, 48432 flow [2023-10-12 17:22:16,885 INFO L124 PetriNetUnfolderBase]: 3207/5424 cut-off events. [2023-10-12 17:22:16,885 INFO L125 PetriNetUnfolderBase]: For 1485/1485 co-relation queries the response was YES. [2023-10-12 17:22:16,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33440 conditions, 5424 events. 3207/5424 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 34660 event pairs, 5 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 21842. Up to 2596 conditions per place. [2023-10-12 17:22:16,889 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 70 places, 3857 transitions, 48432 flow [2023-10-12 17:22:16,918 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 70 places, 3857 transitions, 48432 flow [2023-10-12 17:22:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-10-12 17:22:16,919 INFO L430 stractBuchiCegarLoop]: Abstraction has has 70 places, 3857 transitions, 48432 flow [2023-10-12 17:22:16,919 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:22:16,919 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 3857 transitions, 48432 flow [2023-10-12 17:22:17,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:22:17,638 INFO L124 PetriNetUnfolderBase]: 2575/4334 cut-off events. [2023-10-12 17:22:17,638 INFO L125 PetriNetUnfolderBase]: For 1219/1219 co-relation queries the response was YES. [2023-10-12 17:22:17,638 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:22:17,638 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 293#[L26, L63, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:17,638 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:17,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1087670554, now seen corresponding path program 2 times [2023-10-12 17:22:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:17,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550568990] [2023-10-12 17:22:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:17,645 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065866492] [2023-10-12 17:22:17,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:22:17,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:17,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:17,648 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:17,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-10-12 17:22:17,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:22:17,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:22:17,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2023-10-12 17:22:17,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:22:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:17,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:22:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:22:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550568990] [2023-10-12 17:22:17,814 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:22:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065866492] [2023-10-12 17:22:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065866492] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:22:17,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:22:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-10-12 17:22:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094184170] [2023-10-12 17:22:17,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:22:17,814 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:22:17,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 4 times [2023-10-12 17:22:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850379321] [2023-10-12 17:22:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:17,817 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565959698] [2023-10-12 17:22:17,817 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:22:17,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:17,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:17,820 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:17,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-10-12 17:22:17,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:22:17,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:22:17,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:22:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:17,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:22:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:22:17,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-10-12 17:22:17,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-10-12 17:22:17,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 3857 transitions, 48432 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:22:17,883 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:22:17,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:22:19,891 INFO L124 PetriNetUnfolderBase]: 4495/7569 cut-off events. [2023-10-12 17:22:19,891 INFO L125 PetriNetUnfolderBase]: For 1861/1861 co-relation queries the response was YES. [2023-10-12 17:22:19,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54211 conditions, 7569 events. 4495/7569 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 50153 event pairs, 2 based on Foata normal form. 13/4017 useless extension candidates. Maximal degree in co-relation 50654. Up to 3968 conditions per place. [2023-10-12 17:22:19,933 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 2379 selfloop transitions, 1021 changer transitions 1982/5382 dead transitions. [2023-10-12 17:22:19,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 5382 transitions, 78297 flow [2023-10-12 17:22:19,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 5382 transitions, 78297 flow [2023-10-12 17:22:21,915 INFO L124 PetriNetUnfolderBase]: 4495/7569 cut-off events. [2023-10-12 17:22:21,916 INFO L125 PetriNetUnfolderBase]: For 1861/1861 co-relation queries the response was YES. [2023-10-12 17:22:21,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54211 conditions, 7569 events. 4495/7569 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 50140 event pairs, 2 based on Foata normal form. 0/4004 useless extension candidates. Maximal degree in co-relation 50654. Up to 3968 conditions per place. [2023-10-12 17:22:21,921 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 92 places, 5382 transitions, 78297 flow [2023-10-12 17:22:21,968 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 92 places, 5382 transitions, 78297 flow [2023-10-12 17:22:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-10-12 17:22:21,969 INFO L430 stractBuchiCegarLoop]: Abstraction has has 92 places, 5382 transitions, 78297 flow [2023-10-12 17:22:21,969 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:22:21,969 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 places, 5382 transitions, 78297 flow [2023-10-12 17:22:23,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:22:23,668 INFO L124 PetriNetUnfolderBase]: 3805/6378 cut-off events. [2023-10-12 17:22:23,669 INFO L125 PetriNetUnfolderBase]: For 1577/1577 co-relation queries the response was YES. [2023-10-12 17:22:23,669 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:22:23,669 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:23,669 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:23,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1856400768, now seen corresponding path program 3 times [2023-10-12 17:22:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105788090] [2023-10-12 17:22:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:23,678 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273610064] [2023-10-12 17:22:23,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:22:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:23,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:23,679 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:23,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-10-12 17:22:23,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-10-12 17:22:23,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:22:23,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2023-10-12 17:22:23,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:22:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:23,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:22:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:23,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:22:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105788090] [2023-10-12 17:22:23,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:22:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273610064] [2023-10-12 17:22:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273610064] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:22:23,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:22:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2023-10-12 17:22:23,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042515661] [2023-10-12 17:22:23,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:22:23,901 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:22:23,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 5 times [2023-10-12 17:22:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310082477] [2023-10-12 17:22:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:23,903 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:23,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058494918] [2023-10-12 17:22:23,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-10-12 17:22:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:23,906 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:23,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-10-12 17:22:23,932 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:22:23,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:22:23,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:22:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:23,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:22:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:22:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-10-12 17:22:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-10-12 17:22:23,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 5382 transitions, 78297 flow. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:22:23,967 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:22:23,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:22:27,703 INFO L124 PetriNetUnfolderBase]: 5984/10039 cut-off events. [2023-10-12 17:22:27,704 INFO L125 PetriNetUnfolderBase]: For 2685/2685 co-relation queries the response was YES. [2023-10-12 17:22:27,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81919 conditions, 10039 events. 5984/10039 cut-off events. For 2685/2685 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 67754 event pairs, 0 based on Foata normal form. 13/5309 useless extension candidates. Maximal degree in co-relation 54046. Up to 5613 conditions per place. [2023-10-12 17:22:27,750 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 3136 selfloop transitions, 1412 changer transitions 2589/7137 dead transitions. [2023-10-12 17:22:27,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 7137 transitions, 118056 flow [2023-10-12 17:22:27,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 7137 transitions, 118056 flow [2023-10-12 17:22:31,631 INFO L124 PetriNetUnfolderBase]: 5984/10039 cut-off events. [2023-10-12 17:22:31,631 INFO L125 PetriNetUnfolderBase]: For 2685/2685 co-relation queries the response was YES. [2023-10-12 17:22:31,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81919 conditions, 10039 events. 5984/10039 cut-off events. For 2685/2685 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 67767 event pairs, 0 based on Foata normal form. 0/5296 useless extension candidates. Maximal degree in co-relation 54046. Up to 5613 conditions per place. [2023-10-12 17:22:31,638 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 122 places, 7137 transitions, 118056 flow [2023-10-12 17:22:31,716 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 122 places, 7137 transitions, 118056 flow [2023-10-12 17:22:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-10-12 17:22:31,717 INFO L430 stractBuchiCegarLoop]: Abstraction has has 122 places, 7137 transitions, 118056 flow [2023-10-12 17:22:31,717 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:22:31,717 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 places, 7137 transitions, 118056 flow [2023-10-12 17:22:34,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:22:34,979 INFO L124 PetriNetUnfolderBase]: 5362/8938 cut-off events. [2023-10-12 17:22:34,980 INFO L125 PetriNetUnfolderBase]: For 2448/2448 co-relation queries the response was YES. [2023-10-12 17:22:34,980 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:22:34,980 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:34,980 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:34,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2084606328, now seen corresponding path program 4 times [2023-10-12 17:22:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:34,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807006251] [2023-10-12 17:22:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:34,988 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019166087] [2023-10-12 17:22:34,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:22:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:34,991 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:34,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-10-12 17:22:35,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:22:35,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:22:35,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2023-10-12 17:22:35,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:22:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:35,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:22:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:22:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807006251] [2023-10-12 17:22:35,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:22:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019166087] [2023-10-12 17:22:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019166087] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:22:35,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:22:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-10-12 17:22:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841419946] [2023-10-12 17:22:35,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:22:35,223 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:22:35,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 6 times [2023-10-12 17:22:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:35,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428017573] [2023-10-12 17:22:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:35,225 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421981927] [2023-10-12 17:22:35,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-10-12 17:22:35,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:35,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:35,230 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:35,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-10-12 17:22:35,260 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-10-12 17:22:35,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:22:35,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:22:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:35,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:22:35,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:22:35,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-10-12 17:22:35,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-10-12 17:22:35,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 7137 transitions, 118056 flow. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:22:35,294 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:22:35,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:22:42,363 INFO L124 PetriNetUnfolderBase]: 7675/12837 cut-off events. [2023-10-12 17:22:42,363 INFO L125 PetriNetUnfolderBase]: For 3445/3445 co-relation queries the response was YES. [2023-10-12 17:22:42,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117563 conditions, 12837 events. 7675/12837 cut-off events. For 3445/3445 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 88322 event pairs, 1 based on Foata normal form. 13/6767 useless extension candidates. Maximal degree in co-relation 77882. Up to 7523 conditions per place. [2023-10-12 17:22:42,427 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 3997 selfloop transitions, 1869 changer transitions 3261/9127 dead transitions. [2023-10-12 17:22:42,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 9127 transitions, 169170 flow [2023-10-12 17:22:42,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 9127 transitions, 169170 flow [2023-10-12 17:22:49,379 INFO L124 PetriNetUnfolderBase]: 7675/12837 cut-off events. [2023-10-12 17:22:49,379 INFO L125 PetriNetUnfolderBase]: For 3445/3445 co-relation queries the response was YES. [2023-10-12 17:22:49,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117563 conditions, 12837 events. 7675/12837 cut-off events. For 3445/3445 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 88323 event pairs, 1 based on Foata normal form. 0/6754 useless extension candidates. Maximal degree in co-relation 77882. Up to 7523 conditions per place. [2023-10-12 17:22:49,387 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 161 places, 9127 transitions, 169170 flow [2023-10-12 17:22:49,505 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 161 places, 9127 transitions, 169170 flow [2023-10-12 17:22:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-10-12 17:22:49,507 INFO L430 stractBuchiCegarLoop]: Abstraction has has 161 places, 9127 transitions, 169170 flow [2023-10-12 17:22:49,507 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:22:49,507 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 161 places, 9127 transitions, 169170 flow [2023-10-12 17:22:55,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:22:55,535 INFO L124 PetriNetUnfolderBase]: 6908/11515 cut-off events. [2023-10-12 17:22:55,535 INFO L125 PetriNetUnfolderBase]: For 3171/3171 co-relation queries the response was YES. [2023-10-12 17:22:55,535 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:22:55,535 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 293#[L26, L63, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:55,535 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:22:55,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1947136140, now seen corresponding path program 5 times [2023-10-12 17:22:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859420046] [2023-10-12 17:22:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:55,547 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023559431] [2023-10-12 17:22:55,548 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-10-12 17:22:55,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:55,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:55,550 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:55,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-10-12 17:22:55,701 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-10-12 17:22:55,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:22:55,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2023-10-12 17:22:55,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:22:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:55,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:22:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:22:55,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:22:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859420046] [2023-10-12 17:22:55,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:22:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023559431] [2023-10-12 17:22:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023559431] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:22:55,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:22:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2023-10-12 17:22:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056896514] [2023-10-12 17:22:55,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:22:55,936 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:22:55,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:22:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 7 times [2023-10-12 17:22:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:22:55,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676915132] [2023-10-12 17:22:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:22:55,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:22:55,939 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:22:55,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288612531] [2023-10-12 17:22:55,939 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-10-12 17:22:55,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:22:55,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:22:55,941 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:22:55,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-10-12 17:22:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:55,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:22:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:22:55,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:22:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:22:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-10-12 17:22:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-10-12 17:22:56,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 9127 transitions, 169170 flow. Second operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:22:56,006 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:22:56,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:23:07,633 INFO L124 PetriNetUnfolderBase]: 9560/15947 cut-off events. [2023-10-12 17:23:07,633 INFO L125 PetriNetUnfolderBase]: For 4283/4283 co-relation queries the response was YES. [2023-10-12 17:23:07,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161967 conditions, 15947 events. 9560/15947 cut-off events. For 4283/4283 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 111229 event pairs, 0 based on Foata normal form. 13/8385 useless extension candidates. Maximal degree in co-relation 107644. Up to 9706 conditions per place. [2023-10-12 17:23:07,723 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 4952 selfloop transitions, 2388 changer transitions 3996/11336 dead transitions. [2023-10-12 17:23:07,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 11336 transitions, 232729 flow [2023-10-12 17:23:07,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 11336 transitions, 232729 flow [2023-10-12 17:23:20,889 INFO L124 PetriNetUnfolderBase]: 9560/15947 cut-off events. [2023-10-12 17:23:20,889 INFO L125 PetriNetUnfolderBase]: For 4283/4283 co-relation queries the response was YES. [2023-10-12 17:23:20,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161967 conditions, 15947 events. 9560/15947 cut-off events. For 4283/4283 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 111268 event pairs, 0 based on Foata normal form. 0/8372 useless extension candidates. Maximal degree in co-relation 107644. Up to 9706 conditions per place. [2023-10-12 17:23:20,901 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 210 places, 11336 transitions, 232729 flow [2023-10-12 17:23:21,089 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 210 places, 11336 transitions, 232729 flow [2023-10-12 17:23:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-10-12 17:23:21,090 INFO L430 stractBuchiCegarLoop]: Abstraction has has 210 places, 11336 transitions, 232729 flow [2023-10-12 17:23:21,090 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:23:21,090 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 210 places, 11336 transitions, 232729 flow [2023-10-12 17:23:31,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:31,185 INFO L124 PetriNetUnfolderBase]: 8826/14669 cut-off events. [2023-10-12 17:23:31,185 INFO L125 PetriNetUnfolderBase]: For 4038/4038 co-relation queries the response was YES. [2023-10-12 17:23:31,185 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:31,186 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:23:31,186 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:23:31,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1036788936, now seen corresponding path program 6 times [2023-10-12 17:23:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604441097] [2023-10-12 17:23:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:31,192 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:23:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710845991] [2023-10-12 17:23:31,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-10-12 17:23:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:23:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:31,194 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:23:31,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-10-12 17:23:31,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-10-12 17:23:31,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:23:31,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2023-10-12 17:23:31,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 29 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:23:31,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:23:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 29 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:23:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:23:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604441097] [2023-10-12 17:23:31,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:23:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710845991] [2023-10-12 17:23:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710845991] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:23:31,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:23:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2023-10-12 17:23:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317790799] [2023-10-12 17:23:31,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:23:31,585 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:23:31,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 8 times [2023-10-12 17:23:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364704710] [2023-10-12 17:23:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:31,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:31,591 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:23:31,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333670366] [2023-10-12 17:23:31,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:23:31,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:23:31,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:31,593 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:23:31,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-10-12 17:23:31,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:23:31,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:23:31,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:31,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:23:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-10-12 17:23:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2023-10-12 17:23:31,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 11336 transitions, 232729 flow. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:23:31,658 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:23:31,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:23:46,773 INFO L124 PetriNetUnfolderBase]: 11647/19385 cut-off events. [2023-10-12 17:23:46,773 INFO L125 PetriNetUnfolderBase]: For 4969/4969 co-relation queries the response was YES. [2023-10-12 17:23:46,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216243 conditions, 19385 events. 11647/19385 cut-off events. For 4969/4969 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 137388 event pairs, 0 based on Foata normal form. 13/10169 useless extension candidates. Maximal degree in co-relation 203170. Up to 12154 conditions per place. [2023-10-12 17:23:46,864 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 6011 selfloop transitions, 2973 changer transitions 4796/13780 dead transitions. [2023-10-12 17:23:46,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 13780 transitions, 310399 flow [2023-10-12 17:23:46,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 13780 transitions, 310399 flow [2023-10-12 17:24:04,652 INFO L124 PetriNetUnfolderBase]: 11647/19385 cut-off events. [2023-10-12 17:24:04,652 INFO L125 PetriNetUnfolderBase]: For 4969/4969 co-relation queries the response was YES. [2023-10-12 17:24:04,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216243 conditions, 19385 events. 11647/19385 cut-off events. For 4969/4969 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 137337 event pairs, 0 based on Foata normal form. 0/10156 useless extension candidates. Maximal degree in co-relation 203170. Up to 12154 conditions per place. [2023-10-12 17:24:04,665 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 270 places, 13780 transitions, 310399 flow [2023-10-12 17:24:04,882 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 270 places, 13780 transitions, 310399 flow [2023-10-12 17:24:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-10-12 17:24:04,883 INFO L430 stractBuchiCegarLoop]: Abstraction has has 270 places, 13780 transitions, 310399 flow [2023-10-12 17:24:04,883 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:24:04,883 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 270 places, 13780 transitions, 310399 flow [2023-10-12 17:24:21,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:24:21,963 INFO L124 PetriNetUnfolderBase]: 10763/17894 cut-off events. [2023-10-12 17:24:21,963 INFO L125 PetriNetUnfolderBase]: For 4714/4714 co-relation queries the response was YES. [2023-10-12 17:24:21,963 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:24:21,964 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:24:21,964 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:24:21,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:21,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1703700322, now seen corresponding path program 7 times [2023-10-12 17:24:21,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:21,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252959123] [2023-10-12 17:24:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:21,971 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:24:21,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818554089] [2023-10-12 17:24:21,971 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-10-12 17:24:21,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:24:21,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:24:21,972 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:24:21,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-10-12 17:24:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:24:22,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2023-10-12 17:24:22,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:24:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 37 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:24:22,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:24:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 37 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:24:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:24:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252959123] [2023-10-12 17:24:22,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:24:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818554089] [2023-10-12 17:24:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818554089] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:24:22,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:24:22,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2023-10-12 17:24:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909095514] [2023-10-12 17:24:22,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:24:22,331 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:24:22,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:24:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 9 times [2023-10-12 17:24:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:24:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410783542] [2023-10-12 17:24:22,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:24:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:24:22,334 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:24:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109370805] [2023-10-12 17:24:22,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:24:22,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:24:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:24:22,335 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:24:22,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-10-12 17:24:22,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-10-12 17:24:22,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:24:22,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:24:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:24:22,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:24:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:24:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-10-12 17:24:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2023-10-12 17:24:22,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 13780 transitions, 310399 flow. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:24:22,404 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:24:22,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:24:51,803 INFO L124 PetriNetUnfolderBase]: 13928/23135 cut-off events. [2023-10-12 17:24:51,803 INFO L125 PetriNetUnfolderBase]: For 5949/5949 co-relation queries the response was YES. [2023-10-12 17:24:51,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281183 conditions, 23135 events. 13928/23135 cut-off events. For 5949/5949 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 165995 event pairs, 1 based on Foata normal form. 13/12113 useless extension candidates. Maximal degree in co-relation 264341. Up to 14875 conditions per place. [2023-10-12 17:24:51,923 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 7164 selfloop transitions, 3620 changer transitions 5659/16443 dead transitions. [2023-10-12 17:24:51,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 16443 transitions, 403206 flow [2023-10-12 17:24:51,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 16443 transitions, 403206 flow [2023-10-12 17:25:30,824 INFO L124 PetriNetUnfolderBase]: 13928/23135 cut-off events. [2023-10-12 17:25:30,825 INFO L125 PetriNetUnfolderBase]: For 5949/5949 co-relation queries the response was YES. [2023-10-12 17:25:30,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281183 conditions, 23135 events. 13928/23135 cut-off events. For 5949/5949 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 165952 event pairs, 1 based on Foata normal form. 0/12100 useless extension candidates. Maximal degree in co-relation 264341. Up to 14875 conditions per place. [2023-10-12 17:25:30,847 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 342 places, 16443 transitions, 403206 flow [2023-10-12 17:25:31,195 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 342 places, 16443 transitions, 403206 flow [2023-10-12 17:25:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-10-12 17:25:31,196 INFO L430 stractBuchiCegarLoop]: Abstraction has has 342 places, 16443 transitions, 403206 flow [2023-10-12 17:25:31,196 INFO L337 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-10-12 17:25:31,196 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 342 places, 16443 transitions, 403206 flow [2023-10-12 17:26:10,627 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:10,627 INFO L124 PetriNetUnfolderBase]: 13003/21593 cut-off events. [2023-10-12 17:26:10,627 INFO L125 PetriNetUnfolderBase]: For 5696/5696 co-relation queries the response was YES. [2023-10-12 17:26:10,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:10,628 INFO L748 eck$LassoCheckResult]: Stem: 26#[$Ultimate##0]true [70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28#[L62, $Ultimate##0]true [73] L62-->$Ultimate##0: 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] 76#[L63, $Ultimate##0, $Ultimate##0]true [63] $Ultimate##0-->L51: Formula: (= v_i_4 0) InVars {} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 78#[L51, L63, $Ultimate##0]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 81#[L45, L63, $Ultimate##0]true [60] $Ultimate##0-->L26: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x] 137#[L26, L45, L63]true [67] L45-->L51: Formula: (and (= v_i_15 (+ v_i_16 1)) (<= v_M_9 v_j_15)) InVars {i=v_i_16, M=v_M_9, j=v_j_15} OutVars{i=v_i_15, M=v_M_9, j=v_j_15} AuxVars[] AssignedVars[i] 135#[L26, L51, L63]true [64] L51-->L45: Formula: (and (< v_i_7 v_N_4) (= v_j_7 0)) InVars {i=v_i_7, N=v_N_4} OutVars{i=v_i_7, N=v_N_4, j=v_j_7} AuxVars[] AssignedVars[j] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:26:10,628 INFO L750 eck$LassoCheckResult]: Loop: 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [66] L45-->L45: Formula: (and (= (store v_B_9 v_i_13 (store (select v_B_9 v_i_13) v_j_12 (select v_F_7 (+ v_j_12 (* v_i_13 v_M_7))))) v_B_8) (< v_j_12 v_M_7) (= v_j_11 (+ v_j_12 1))) InVars {i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_12, B=v_B_9} OutVars{i=v_i_13, F=v_F_7, M=v_M_7, j=v_j_11, B=v_B_8} AuxVars[] AssignedVars[j, B] 137#[L26, L45, L63]true [2023-10-12 17:26:10,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash -413385412, now seen corresponding path program 8 times [2023-10-12 17:26:10,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385590077] [2023-10-12 17:26:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:10,635 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:26:10,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218384786] [2023-10-12 17:26:10,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:26:10,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:26:10,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:10,640 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:26:10,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-10-12 17:26:10,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:26:10,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:26:10,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2023-10-12 17:26:10,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 46 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:26:10,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:26:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 46 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:26:11,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:11,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385590077] [2023-10-12 17:26:11,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-10-12 17:26:11,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218384786] [2023-10-12 17:26:11,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218384786] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:26:11,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-10-12 17:26:11,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2023-10-12 17:26:11,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725929974] [2023-10-12 17:26:11,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-10-12 17:26:11,078 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:26:11,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash 3073, now seen corresponding path program 10 times [2023-10-12 17:26:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:11,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568240466] [2023-10-12 17:26:11,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:11,081 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-10-12 17:26:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312288672] [2023-10-12 17:26:11,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:26:11,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:26:11,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:11,084 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:26:11,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-10-12 17:26:11,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:26:11,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-10-12 17:26:11,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:11,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:11,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-10-12 17:26:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-10-12 17:26:11,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 16443 transitions, 403206 flow. Second operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:26:11,168 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:11,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-10-12 17:26:29,526 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: clock still running: AutomataDifference at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopStatisticsGenerator.getValue(CegarLoopStatisticsGenerator.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmarkGenerator.getValue(BuchiCegarLoopBenchmarkGenerator.java:131) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.aggregateBenchmarkData(StatisticsData.java:60) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.(BuchiAutomizerTimingBenchmark.java:39) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-10-12 17:26:29,528 INFO L158 Benchmark]: Toolchain (without parser) took 273450.59ms. Allocated memory was 197.1MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 151.2MB in the beginning and 1.1GB in the end (delta: -922.9MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-10-12 17:26:29,528 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 197.1MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:26:29,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.44ms. Allocated memory is still 197.1MB. Free memory was 151.2MB in the beginning and 149.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:26:29,529 INFO L158 Benchmark]: Boogie Preprocessor took 19.99ms. Allocated memory is still 197.1MB. Free memory was 149.6MB in the beginning and 148.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:26:29,529 INFO L158 Benchmark]: RCFGBuilder took 249.05ms. Allocated memory is still 197.1MB. Free memory was 148.5MB in the beginning and 138.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:26:29,529 INFO L158 Benchmark]: BuchiAutomizer took 273159.79ms. Allocated memory was 197.1MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 137.8MB in the beginning and 1.1GB in the end (delta: -936.3MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-10-12 17:26:29,530 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.24ms. Allocated memory is still 197.1MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.44ms. Allocated memory is still 197.1MB. Free memory was 151.2MB in the beginning and 149.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.99ms. Allocated memory is still 197.1MB. Free memory was 149.6MB in the beginning and 148.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.05ms. Allocated memory is still 197.1MB. Free memory was 148.5MB in the beginning and 138.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 273159.79ms. Allocated memory was 197.1MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 137.8MB in the beginning and 1.1GB in the end (delta: -936.3MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 20 PlacesBefore, 18 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: clock still running: AutomataDifference de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: clock still running: AutomataDifference: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopStatisticsGenerator.getValue(CegarLoopStatisticsGenerator.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown