/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:24,878 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:24,975 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:37:24,995 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:24,995 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:24,995 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:24,996 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:24,996 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:25,000 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:25,002 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:25,003 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:25,003 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:25,003 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:25,004 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:25,004 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:25,005 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:25,005 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:25,005 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:25,005 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:25,005 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:25,006 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:25,006 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:25,007 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:25,007 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:25,007 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:25,007 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:25,007 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:25,007 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:25,007 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:25,008 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:25,008 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:25,008 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:25,009 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:25,010 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:25,010 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 -> RABIN_PETRI_NET [2023-10-12 17:37:25,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:25,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:25,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:25,231 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:25,242 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:25,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl [2023-10-12 17:37:25,244 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sumsumsampleabs2.bpl' [2023-10-12 17:37:25,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:25,265 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:25,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:25,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:25,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:25,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,288 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:25,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:25,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:25,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:25,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:25,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:25,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:25,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:25,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:25,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/1) ... [2023-10-12 17:37:25,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:25,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:25,333 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:37:25,354 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:37:25,376 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum1 given in one single declaration [2023-10-12 17:37:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure sum1 [2023-10-12 17:37:25,376 INFO L138 BoogieDeclarations]: Found implementation of procedure sum1 [2023-10-12 17:37:25,377 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum2 given in one single declaration [2023-10-12 17:37:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure sum2 [2023-10-12 17:37:25,377 INFO L138 BoogieDeclarations]: Found implementation of procedure sum2 [2023-10-12 17:37:25,377 INFO L124 BoogieDeclarations]: Specification and implementation of procedure bank given in one single declaration [2023-10-12 17:37:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure bank [2023-10-12 17:37:25,377 INFO L138 BoogieDeclarations]: Found implementation of procedure bank [2023-10-12 17:37:25,377 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:25,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:25,377 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:37:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:37:25,378 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:37:25,378 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:37:25,412 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:25,414 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:25,487 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:25,491 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:25,492 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:25,495 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:25 BoogieIcfgContainer [2023-10-12 17:37:25,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:25,495 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:25,505 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:25,508 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:25,508 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:25,509 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:25" (1/2) ... [2023-10-12 17:37:25,509 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bda5824 and model type sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:25, skipping insertion in model container [2023-10-12 17:37:25,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:25,510 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:25" (2/2) ... [2023-10-12 17:37:25,511 INFO L332 chiAutomizerObserver]: Analyzing ICFG sumsumsampleabs2.bpl [2023-10-12 17:37:25,560 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:25,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 106 flow [2023-10-12 17:37:25,594 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2023-10-12 17:37:25,594 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:25,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-10-12 17:37:25,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 106 flow [2023-10-12 17:37:25,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 82 flow [2023-10-12 17:37:25,602 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:25,611 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 82 flow [2023-10-12 17:37:25,612 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 82 flow [2023-10-12 17:37:25,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 82 flow [2023-10-12 17:37:25,619 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2023-10-12 17:37:25,619 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:25,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-10-12 17:37:25,620 INFO L119 LiptonReduction]: Number of co-enabled transitions 550 [2023-10-12 17:37:25,831 INFO L134 LiptonReduction]: Checked pairs total: 693 [2023-10-12 17:37:25,831 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:37:25,840 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:25,840 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:25,840 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:25,841 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:25,841 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:25,841 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:25,841 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:25,841 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:25,841 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 23 transitions, 64 flow [2023-10-12 17:37:25,845 ERROR L47 etriNetUnfolderRabin]: [1:1A:[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0][10], 2:2A:[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x][7], 4:3A:[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1][2], 7:4A:[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1][13]][11:5A:[116] L23-1-->L25: Formula: (and (< v_i1_15 v_N_13) (= (+ (let ((.cse0 (select v_A_9 v_i1_15))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum1_13) v_sum1_12)) InVars {sum1=v_sum1_13, A=v_A_9, N=v_N_13, i1=v_i1_15} OutVars{sum1=v_sum1_12, A=v_A_9, N=v_N_13, i1=v_i1_15} AuxVars[] AssignedVars[sum1][19], 12:6A:[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1][9]] [2023-10-12 17:37:25,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:25,846 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-10-12 17:37:25,846 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:37:25,846 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:25,848 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:25,848 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 23 transitions, 64 flow [2023-10-12 17:37:25,850 ERROR L47 etriNetUnfolderRabin]: [1:1A:[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0][10], 2:2A:[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x][7], 4:3A:[76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1][2], 7:4A:[77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1][13]][11:5A:[116] L23-1-->L25: Formula: (and (< v_i1_15 v_N_13) (= (+ (let ((.cse0 (select v_A_9 v_i1_15))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum1_13) v_sum1_12)) InVars {sum1=v_sum1_13, A=v_A_9, N=v_N_13, i1=v_i1_15} OutVars{sum1=v_sum1_12, A=v_A_9, N=v_N_13, i1=v_i1_15} AuxVars[] AssignedVars[sum1][19], 12:6A:[82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1][9]] [2023-10-12 17:37:25,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:25,851 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-10-12 17:37:25,851 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:37:25,851 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:25,857 INFO L748 eck$LassoCheckResult]: Stem: 50#[$Ultimate##0]true [101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0] 52#[$Ultimate##0, L68]true [104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x] 54#[$Ultimate##0, $Ultimate##0, L69]true [76] $Ultimate##0-->L22: Formula: (= v_sum1_1 0) InVars {} OutVars{sum1=v_sum1_1} AuxVars[] AssignedVars[sum1] 56#[$Ultimate##0, L69, L22]true [77] L22-->L23-1: Formula: (= v_i1_1 0) InVars {} OutVars{i1=v_i1_1} AuxVars[] AssignedVars[i1] 58#[L23-1, $Ultimate##0, L69]true [2023-10-12 17:37:25,858 INFO L750 eck$LassoCheckResult]: Loop: 58#[L23-1, $Ultimate##0, L69]true [116] L23-1-->L25: Formula: (and (< v_i1_15 v_N_13) (= (+ (let ((.cse0 (select v_A_9 v_i1_15))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum1_13) v_sum1_12)) InVars {sum1=v_sum1_13, A=v_A_9, N=v_N_13, i1=v_i1_15} OutVars{sum1=v_sum1_12, A=v_A_9, N=v_N_13, i1=v_i1_15} AuxVars[] AssignedVars[sum1] 61#[L25, $Ultimate##0, L69]true [82] L25-->L23-1: Formula: (= v_i1_4 (+ v_i1_5 1)) InVars {i1=v_i1_5} OutVars{i1=v_i1_4} AuxVars[] AssignedVars[i1] 58#[L23-1, $Ultimate##0, L69]true [2023-10-12 17:37:25,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash 4034789, now seen corresponding path program 1 times [2023-10-12 17:37:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069918733] [2023-10-12 17:37:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:25,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash 4639, now seen corresponding path program 1 times [2023-10-12 17:37:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:25,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328743958] [2023-10-12 17:37:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:25,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash -417531389, now seen corresponding path program 1 times [2023-10-12 17:37:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:25,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839621749] [2023-10-12 17:37:25,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:25,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:26,136 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:26,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:26,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:26,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:26,137 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:26,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:26,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:26,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:26,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:26,138 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:26,151 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:37:26,162 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:37:26,208 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:37:26,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:37:26,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:37:26,303 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:26,306 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:26,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,310 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:37:26,314 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:37:26,322 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:37:26,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:26,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:26,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:26,359 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:37:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,362 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:37:26,372 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:37:26,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:26,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:26,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:26,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:26,384 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:37:26,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:26,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:26,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:26,405 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:26,405 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:26,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:26,409 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:37:26,411 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:37:26,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:26,435 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:26,435 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:26,436 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N) = -1*i1 + 1*N Supporting invariants [] [2023-10-12 17:37:26,441 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:37:26,443 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:26,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:26,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:26,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:26,494 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:26,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:26,509 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:37:26,545 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:37:26,681 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:37:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:37:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-10-12 17:37:26,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 242 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:26,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 242 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:37:26,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 242 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:37:26,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:26,693 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 138 transitions, 660 flow [2023-10-12 17:37:26,694 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:26,694 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 138 transitions, 660 flow [2023-10-12 17:37:26,717 ERROR L47 etriNetUnfolderRabin]: [1:1A:[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0][62], 2:2A:[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x][44], 6:3A:[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y][26], 22:4A:[110] L70-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j][86], 67:5A:[93] $Ultimate##0-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j][50]][68:6A:[121] L57-1-->L57-1: Formula: (and (= v_mapAbsThread1of1ForFork3_j_25 (+ v_mapAbsThread1of1ForFork3_j_26 1)) (< v_mapAbsThread1of1ForFork3_j_26 v_N_23) (= (store v_A_28 v_mapAbsThread1of1ForFork3_j_26 (let ((.cse0 (select v_A_28 v_mapAbsThread1of1ForFork3_j_26))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_27)) InVars {A=v_A_28, N=v_N_23, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_26} OutVars{A=v_A_27, N=v_N_23, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_25} AuxVars[] AssignedVars[A, mapAbsThread1of1ForFork3_j][134]] [2023-10-12 17:37:26,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:26,717 INFO L124 PetriNetUnfolderBase]: 39/67 cut-off events. [2023-10-12 17:37:26,717 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-10-12 17:37:26,718 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:26,720 INFO L748 eck$LassoCheckResult]: Stem: 50#[$Ultimate##0]true [101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0] 52#[$Ultimate##0, L68]true [104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x] 54#[$Ultimate##0, $Ultimate##0, L69]true [107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y] 110#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L70]true [110] L70-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j] 112#[$Ultimate##0, $Ultimate##0, L71, $Ultimate##0, $Ultimate##0]true [93] $Ultimate##0-->L57-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 114#[$Ultimate##0, L57-1, $Ultimate##0, L71, $Ultimate##0]true [2023-10-12 17:37:26,720 INFO L750 eck$LassoCheckResult]: Loop: 114#[$Ultimate##0, L57-1, $Ultimate##0, L71, $Ultimate##0]true [121] L57-1-->L57-1: Formula: (and (= v_mapAbsThread1of1ForFork3_j_25 (+ v_mapAbsThread1of1ForFork3_j_26 1)) (< v_mapAbsThread1of1ForFork3_j_26 v_N_23) (= (store v_A_28 v_mapAbsThread1of1ForFork3_j_26 (let ((.cse0 (select v_A_28 v_mapAbsThread1of1ForFork3_j_26))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_27)) InVars {A=v_A_28, N=v_N_23, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_26} OutVars{A=v_A_27, N=v_N_23, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_25} AuxVars[] AssignedVars[A, mapAbsThread1of1ForFork3_j] 114#[$Ultimate##0, L57-1, $Ultimate##0, L71, $Ultimate##0]true [2023-10-12 17:37:26,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash 125109366, now seen corresponding path program 1 times [2023-10-12 17:37:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254603935] [2023-10-12 17:37:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:26,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:37:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795033617] [2023-10-12 17:37:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:26,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash -416576829, now seen corresponding path program 1 times [2023-10-12 17:37:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581174478] [2023-10-12 17:37:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:26,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:26,875 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:26,875 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:26,875 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:26,875 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:26,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:26,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:26,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:26,875 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:26,876 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:26,876 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:26,879 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:37:26,881 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:37:26,884 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:37:26,886 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:37:26,888 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:37:26,890 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:37:26,902 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:37:26,904 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:37:26,906 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:37:26,908 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:37:26,909 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:37:26,911 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:37:26,913 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:37:26,999 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:26,999 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:26,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:26,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,012 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:37:27,064 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:37:27,077 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:37:27,077 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:37:27,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,104 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:37:27,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,106 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:37:27,107 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:37:27,109 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:37:27,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:37:27,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,144 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:37:27,145 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:37:27,147 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:37:27,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,182 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:37:27,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,185 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:37:27,187 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:37:27,188 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:37:27,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:37:27,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,227 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:37:27,229 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:37:27,265 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:37:27,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,303 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:37:27,307 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:37:27,308 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:37:27,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:27,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:27,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:27,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,333 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:37:27,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,337 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:37:27,339 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:37:27,341 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:37:27,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:27,368 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:27,368 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:27,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,373 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:37:27,375 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:37:27,377 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:27,398 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:27,398 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:27,398 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2023-10-12 17:37:27,403 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:37:27,404 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:27,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:27,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:27,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:27,435 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:27,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:27,436 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:37:27,436 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:37:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:37:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-10-12 17:37:27,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 143 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:27,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:27,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 143 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:27,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:27,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 143 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:27,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:27,493 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 552 transitions, 3744 flow [2023-10-12 17:37:27,493 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:27,493 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 43 places, 552 transitions, 3744 flow [2023-10-12 17:37:27,529 ERROR L47 etriNetUnfolderRabin]: [1:1A:[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0][248], 2:2A:[104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x][176], 6:3A:[107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y][104], 17:4A:[83] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2][128], 58:5A:[84] L34-->L35-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2][152]][146:6A:[118] L35-1-->L37: Formula: (and (< v_i2_23 v_N_17) (= (+ (let ((.cse0 (select v_A_17 v_i2_23))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_23) v_sum2_22)) InVars {A=v_A_17, sum2=v_sum2_23, N=v_N_17, i2=v_i2_23} OutVars{A=v_A_17, sum2=v_sum2_22, N=v_N_17, i2=v_i2_23} AuxVars[] AssignedVars[sum2][488], 147:7A:[89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2][8]] [2023-10-12 17:37:27,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:27,530 INFO L124 PetriNetUnfolderBase]: 94/146 cut-off events. [2023-10-12 17:37:27,530 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-10-12 17:37:27,530 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:27,531 INFO L748 eck$LassoCheckResult]: Stem: 50#[$Ultimate##0]true [101] $Ultimate##0-->$Ultimate##0: Formula: (= v_bankThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{bankThread1of1ForFork0_thidvar0=v_bankThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[bankThread1of1ForFork0_thidvar0] 52#[$Ultimate##0, L68]true [104] L68-->$Ultimate##0: Formula: (and (= 2 v_sum1Thread1of1ForFork1_thidvar1_2) (= 2 v_sum1Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sum1Thread1of1ForFork1_thidvar1=v_sum1Thread1of1ForFork1_thidvar1_2, sum1Thread1of1ForFork1_thidvar0=v_sum1Thread1of1ForFork1_thidvar0_2, sum1Thread1of1ForFork1_x=v_sum1Thread1of1ForFork1_x_2} AuxVars[] AssignedVars[sum1Thread1of1ForFork1_thidvar1, sum1Thread1of1ForFork1_thidvar0, sum1Thread1of1ForFork1_x] 54#[$Ultimate##0, $Ultimate##0, L69]true [107] L69-->$Ultimate##0: Formula: (and (= 3 v_sum2Thread1of1ForFork2_thidvar1_2) (= 3 v_sum2Thread1of1ForFork2_thidvar2_2) (= 3 v_sum2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{sum2Thread1of1ForFork2_thidvar0=v_sum2Thread1of1ForFork2_thidvar0_2, sum2Thread1of1ForFork2_thidvar1=v_sum2Thread1of1ForFork2_thidvar1_2, sum2Thread1of1ForFork2_thidvar2=v_sum2Thread1of1ForFork2_thidvar2_2, sum2Thread1of1ForFork2_y=v_sum2Thread1of1ForFork2_y_2} AuxVars[] AssignedVars[sum2Thread1of1ForFork2_thidvar0, sum2Thread1of1ForFork2_thidvar1, sum2Thread1of1ForFork2_thidvar2, sum2Thread1of1ForFork2_y] 110#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L70]true [83] $Ultimate##0-->L34: Formula: (= v_sum2_3 0) InVars {} OutVars{sum2=v_sum2_3} AuxVars[] AssignedVars[sum2] 155#[$Ultimate##0, $Ultimate##0, L34, L70]true [84] L34-->L35-1: Formula: (= v_i2_6 0) InVars {} OutVars{i2=v_i2_6} AuxVars[] AssignedVars[i2] 157#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [2023-10-12 17:37:27,531 INFO L750 eck$LassoCheckResult]: Loop: 157#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [118] L35-1-->L37: Formula: (and (< v_i2_23 v_N_17) (= (+ (let ((.cse0 (select v_A_17 v_i2_23))) (ite (< .cse0 0) (- .cse0) .cse0)) v_sum2_23) v_sum2_22)) InVars {A=v_A_17, sum2=v_sum2_23, N=v_N_17, i2=v_i2_23} OutVars{A=v_A_17, sum2=v_sum2_22, N=v_N_17, i2=v_i2_23} AuxVars[] AssignedVars[sum2] 160#[$Ultimate##0, L37, $Ultimate##0, L70]true [89] L37-->L35-1: Formula: (= (+ v_i2_4 1) v_i2_3) InVars {i2=v_i2_4} OutVars{i2=v_i2_3} AuxVars[] AssignedVars[i2] 157#[$Ultimate##0, L35-1, $Ultimate##0, L70]true [2023-10-12 17:37:27,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 125108520, now seen corresponding path program 1 times [2023-10-12 17:37:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578380200] [2023-10-12 17:37:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:27,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash 4708, now seen corresponding path program 1 times [2023-10-12 17:37:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305895549] [2023-10-12 17:37:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:27,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash -29792821, now seen corresponding path program 1 times [2023-10-12 17:37:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:27,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640962539] [2023-10-12 17:37:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:27,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:27,643 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:27,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:27,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:27,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:27,644 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:27,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:27,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:27,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: sumsumsampleabs2.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:37:27,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:27,644 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:27,645 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:37:27,647 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:37:27,649 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:37:27,650 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:37:27,652 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:37:27,653 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:37:27,675 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:37:27,677 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:37:27,679 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:37:27,765 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:27,765 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:27,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,766 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:37:27,768 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:37:27,769 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:37:27,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,784 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:37:27,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,785 INFO L229 MonitoredProcess]: Starting monitored process 14 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:37:27,789 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:37:27,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:27,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:27,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:27,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:37:27,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:27,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,803 INFO L229 MonitoredProcess]: Starting monitored process 15 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:37:27,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:37:27,806 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:37:27,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:27,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,833 INFO L229 MonitoredProcess]: Starting monitored process 16 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:37:27,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:37:27,836 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:37:27,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:27,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,866 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:37:27,868 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:37:27,870 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:37:27,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:27,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:27,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:27,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:27,895 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:37:27,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,896 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:37:27,898 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:37:27,899 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:37:27,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:27,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:27,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:27,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:27,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:27,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:27,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:27,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:27,928 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:27,934 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:37:27,935 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:37:27,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:27,943 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:27,943 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:27,943 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i2) = 1*N - 1*i2 Supporting invariants [] [2023-10-12 17:37:27,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:27,949 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:27,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:27,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:27,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:27,989 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:27,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:27,999 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:37:28,000 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:37:28,104 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:37:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:37:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-10-12 17:37:28,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 242 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:28,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:28,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 242 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:37:28,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:28,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 242 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:37:28,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:28,106 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 3312 transitions, 29088 flow [2023-10-12 17:37:28,106 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:28,106 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 49 places, 3312 transitions, 29088 flow [2023-10-12 17:37:28,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-10-12 17:37:28,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:37:28,488 INFO L124 PetriNetUnfolderBase]: 1796/2410 cut-off events. [2023-10-12 17:37:28,488 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2023-10-12 17:37:28,488 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:28,495 INFO L201 PluginConnector]: Adding new model sumsumsampleabs2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:28 BoogieIcfgContainer [2023-10-12 17:37:28,495 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:28,496 INFO L158 Benchmark]: Toolchain (without parser) took 3230.33ms. Allocated memory was 221.2MB in the beginning and 283.1MB in the end (delta: 61.9MB). Free memory was 169.5MB in the beginning and 97.9MB in the end (delta: 71.6MB). Peak memory consumption was 134.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:28,496 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 221.2MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:28,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.73ms. Allocated memory is still 221.2MB. Free memory was 169.5MB in the beginning and 167.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:28,498 INFO L158 Benchmark]: Boogie Preprocessor took 16.74ms. Allocated memory is still 221.2MB. Free memory was 167.9MB in the beginning and 166.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:28,500 INFO L158 Benchmark]: RCFGBuilder took 186.92ms. Allocated memory is still 221.2MB. Free memory was 166.7MB in the beginning and 157.0MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:28,500 INFO L158 Benchmark]: BuchiAutomizer took 2999.74ms. Allocated memory was 221.2MB in the beginning and 283.1MB in the end (delta: 61.9MB). Free memory was 156.9MB in the beginning and 97.9MB in the end (delta: 59.0MB). Peak memory consumption was 120.8MB. Max. memory is 8.0GB. [2023-10-12 17:37:28,501 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.19ms. Allocated memory is still 221.2MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.73ms. Allocated memory is still 221.2MB. Free memory was 169.5MB in the beginning and 167.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.74ms. Allocated memory is still 221.2MB. Free memory was 167.9MB in the beginning and 166.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 186.92ms. Allocated memory is still 221.2MB. Free memory was 166.7MB in the beginning and 157.0MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2999.74ms. Allocated memory was 221.2MB in the beginning and 283.1MB in the end (delta: 61.9MB). Free memory was 156.9MB in the beginning and 97.9MB in the end (delta: 59.0MB). Peak memory consumption was 120.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 397 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 228 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital62 mio100 ax100 hnf100 lsp112 ukn39 mio100 lsp76 div100 bol100 ite100 ukn100 eq176 hnf98 smp100 dnf145 smp70 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 42 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 23 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 693 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 513, independent: 484, independent conditional: 0, independent unconditional: 484, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 303, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 303, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 513, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 303, unknown conditional: 0, unknown unconditional: 303] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:37:28,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...