/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:19:10,402 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:19:10,460 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:19:10,483 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:19:10,483 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:19:10,484 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:19:10,485 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:19:10,485 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:19:10,486 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:19:10,489 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:19:10,489 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:19:10,489 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:19:10,489 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:19:10,490 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:19:10,491 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:19:10,491 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:19:10,491 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:19:10,491 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:19:10,491 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:19:10,491 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:19:10,492 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:19:10,492 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:19:10,493 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:19:10,493 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:19:10,493 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:19:10,493 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:19:10,493 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:19:10,493 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:19:10,494 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:19:10,494 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:19:10,494 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:19:10,495 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:19:10,495 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:19:10,496 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:19:10,496 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:19:10,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:19:10,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:19:10,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:19:10,725 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:19:10,725 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:19:10,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl [2023-10-12 17:19:10,728 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl' [2023-10-12 17:19:10,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:19:10,750 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:19:10,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:10,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:19:10,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:19:10,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,773 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:19:10,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:10,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:19:10,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:19:10,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:19:10,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:19:10,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:19:10,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:19:10,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:19:10,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/1) ... [2023-10-12 17:19:10,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:10,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:10,830 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:19:10,841 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:19:10,860 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:19:10,861 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:19:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:19:10,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:19:10,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:19:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:19:10,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:19:10,864 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:19:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:19:10,865 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:19:10,865 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:19:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:19:10,865 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:19:10,866 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:19:10,866 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:19:10,866 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:19:10,903 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:19:10,904 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:19:10,992 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:19:10,997 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:19:10,997 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:19:10,998 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:10 BoogieIcfgContainer [2023-10-12 17:19:10,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:19:10,999 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:19:10,999 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:19:11,002 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:19:11,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:11,002 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:10" (1/2) ... [2023-10-12 17:19:11,003 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@691cbbb7 and model type min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:19:11, skipping insertion in model container [2023-10-12 17:19:11,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:11,003 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:10" (2/2) ... [2023-10-12 17:19:11,004 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs.bpl [2023-10-12 17:19:11,051 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:19:11,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 108 flow [2023-10-12 17:19:11,111 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2023-10-12 17:19:11,111 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:19:11,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:19:11,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 108 flow [2023-10-12 17:19:11,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 84 flow [2023-10-12 17:19:11,122 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:19:11,135 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 84 flow [2023-10-12 17:19:11,137 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 84 flow [2023-10-12 17:19:11,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 84 flow [2023-10-12 17:19:11,145 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2023-10-12 17:19:11,145 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:19:11,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:19:11,147 INFO L119 LiptonReduction]: Number of co-enabled transitions 618 [2023-10-12 17:19:11,451 INFO L134 LiptonReduction]: Checked pairs total: 598 [2023-10-12 17:19:11,451 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-10-12 17:19:11,460 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:19:11,460 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:19:11,460 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:19:11,461 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:19:11,461 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:19:11,461 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:19:11,461 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:19:11,461 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:19:11,461 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 places, 19 transitions, 56 flow [2023-10-12 17:19:11,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:11,464 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:19:11,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:11,464 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:11,466 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:19:11,466 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 places, 19 transitions, 56 flow [2023-10-12 17:19:11,467 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:11,467 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:19:11,467 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:11,467 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:11,470 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 53#[$Ultimate##0, L77]true [124] $Ultimate##0-->L32-1: Formula: (and (= v_array_min_23 (select v_A_27 0)) (= v_computeMinThread1of1ForFork0_i1_21 0)) InVars {A=v_A_27} OutVars{A=v_A_27, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_21, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 55#[L32-1, L77]true [2023-10-12 17:19:11,470 INFO L750 eck$LassoCheckResult]: Loop: 55#[L32-1, L77]true [126] L32-1-->L32-1: Formula: (and (< v_computeMinThread1of1ForFork0_i1_30 v_N_17) (= (let ((.cse0 (let ((.cse1 (select v_A_33 v_computeMinThread1of1ForFork0_i1_30))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_30 .cse0) v_array_min_30 .cse0)) v_array_min_29) (= v_computeMinThread1of1ForFork0_i1_29 (+ v_computeMinThread1of1ForFork0_i1_30 1))) InVars {A=v_A_33, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_30, array_min=v_array_min_30, N=v_N_17} OutVars{A=v_A_33, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_29, array_min=v_array_min_29, N=v_N_17} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 55#[L32-1, L77]true [2023-10-12 17:19:11,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 4309, now seen corresponding path program 1 times [2023-10-12 17:19:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682005744] [2023-10-12 17:19:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:11,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash 157, now seen corresponding path program 1 times [2023-10-12 17:19:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725025030] [2023-10-12 17:19:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:11,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash 133705, now seen corresponding path program 1 times [2023-10-12 17:19:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:11,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912683237] [2023-10-12 17:19:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:11,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:11,776 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:11,777 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:11,777 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:11,777 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:11,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:11,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:11,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:11,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:11,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:19:11,778 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:11,778 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:11,791 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:19:11,798 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:19:12,044 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:12,047 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:12,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:12,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:12,050 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:19:12,056 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:19:12,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:12,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:12,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:12,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:12,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:12,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:12,071 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:19:12,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:12,106 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:19:12,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:12,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:12,108 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:19:12,110 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:19:12,111 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:19:12,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:12,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:12,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:12,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:12,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:12,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:12,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:12,143 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:19:12,143 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:19:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:12,147 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:19:12,147 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:19:12,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:12,171 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:12,171 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:12,172 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2023-10-12 17:19:12,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:19:12,176 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:19:12,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:12,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:12,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:12,208 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:19:12,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:12,209 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:19:12,236 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:19:12,237 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:19:12,316 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 322 transitions. [2023-10-12 17:19:12,317 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:12,319 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:12,321 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:19:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:19:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2023-10-12 17:19:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:19:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:19:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:19:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:12,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 216 transitions, 1068 flow [2023-10-12 17:19:12,486 INFO L124 PetriNetUnfolderBase]: 1615/2160 cut-off events. [2023-10-12 17:19:12,487 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2023-10-12 17:19:12,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 2160 events. 1615/2160 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7713 event pairs, 17 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 4298. Up to 687 conditions per place. [2023-10-12 17:19:12,491 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 39 places, 216 transitions, 1068 flow [2023-10-12 17:19:12,493 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 39 places, 216 transitions, 1068 flow [2023-10-12 17:19:12,494 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 216 transitions, 1068 flow [2023-10-12 17:19:12,494 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:19:12,494 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 216 transitions, 1068 flow [2023-10-12 17:19:12,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:12,497 INFO L124 PetriNetUnfolderBase]: 28/48 cut-off events. [2023-10-12 17:19:12,497 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:19:12,497 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:12,498 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 53#[$Ultimate##0, L77]true [107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 99#[$Ultimate##0, L78, $Ultimate##0]true [116] $Ultimate##0-->L46-1: Formula: (and (= v_computeMaxThread1of1ForFork1_i2_15 0) (= (select v_A_9 0) v_array_max_10)) InVars {A=v_A_9} OutVars{A=v_A_9, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_15, array_max=v_array_max_10} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 101#[$Ultimate##0, L46-1, L78]true [2023-10-12 17:19:12,498 INFO L750 eck$LassoCheckResult]: Loop: 101#[$Ultimate##0, L46-1, L78]true [128] L46-1-->L46-1: Formula: (and (= v_array_max_36 (let ((.cse0 (let ((.cse1 (select v_A_49 v_computeMaxThread1of1ForFork1_i2_30))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_37 .cse0) .cse0 v_array_max_37))) (< v_computeMaxThread1of1ForFork1_i2_30 v_N_27) (= (+ v_computeMaxThread1of1ForFork1_i2_30 1) v_computeMaxThread1of1ForFork1_i2_29)) InVars {A=v_A_49, N=v_N_27, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_30, array_max=v_array_max_37} OutVars{A=v_A_49, N=v_N_27, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_29, array_max=v_array_max_36} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 101#[$Ultimate##0, L46-1, L78]true [128] L46-1-->L46-1: Formula: (and (= v_array_max_36 (let ((.cse0 (let ((.cse1 (select v_A_49 v_computeMaxThread1of1ForFork1_i2_30))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_37 .cse0) .cse0 v_array_max_37))) (< v_computeMaxThread1of1ForFork1_i2_30 v_N_27) (= (+ v_computeMaxThread1of1ForFork1_i2_30 1) v_computeMaxThread1of1ForFork1_i2_29)) InVars {A=v_A_49, N=v_N_27, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_30, array_max=v_array_max_37} OutVars{A=v_A_49, N=v_N_27, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_29, array_max=v_array_max_36} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 101#[$Ultimate##0, L46-1, L78]true [2023-10-12 17:19:12,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 133168, now seen corresponding path program 1 times [2023-10-12 17:19:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598086933] [2023-10-12 17:19:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:12,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 5057, now seen corresponding path program 1 times [2023-10-12 17:19:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487830644] [2023-10-12 17:19:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:12,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:12,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 127978544, now seen corresponding path program 1 times [2023-10-12 17:19:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:12,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463445404] [2023-10-12 17:19:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:12,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:12,611 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:19:12,914 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:12,914 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:12,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:12,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:12,915 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:12,915 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:12,915 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:12,915 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:12,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:19:12,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:12,915 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:13,147 WARN L176 XnfTransformerHelper]: Simplifying conjunction of 94864 disjunctions. This might take some time... Received shutdown request... [2023-10-12 17:24:04,127 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:24:04 BoogieIcfgContainer [2023-10-12 17:24:04,128 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:24:04,129 INFO L158 Benchmark]: Toolchain (without parser) took 293377.69ms. Allocated memory was 182.5MB in the beginning and 476.1MB in the end (delta: 293.6MB). Free memory was 135.7MB in the beginning and 161.0MB in the end (delta: -25.4MB). Peak memory consumption was 309.7MB. Max. memory is 8.0GB. [2023-10-12 17:24:04,133 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.40ms. Allocated memory is still 182.5MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:24:04,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.65ms. Allocated memory is still 182.5MB. Free memory was 135.7MB in the beginning and 134.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:24:04,134 INFO L158 Benchmark]: Boogie Preprocessor took 16.99ms. Allocated memory is still 182.5MB. Free memory was 134.1MB in the beginning and 132.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:24:04,135 INFO L158 Benchmark]: RCFGBuilder took 204.88ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 122.9MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:24:04,135 INFO L158 Benchmark]: BuchiAutomizer took 293128.72ms. Allocated memory was 182.5MB in the beginning and 476.1MB in the end (delta: 293.6MB). Free memory was 122.9MB in the beginning and 161.0MB in the end (delta: -38.1MB). Peak memory consumption was 297.1MB. Max. memory is 8.0GB. [2023-10-12 17:24:04,138 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 1.40ms. Allocated memory is still 182.5MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.65ms. Allocated memory is still 182.5MB. Free memory was 135.7MB in the beginning and 134.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.99ms. Allocated memory is still 182.5MB. Free memory was 134.1MB in the beginning and 132.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 204.88ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 122.9MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 293128.72ms. Allocated memory was 182.5MB in the beginning and 476.1MB in the end (delta: 293.6MB). Free memory was 122.9MB in the beginning and 161.0MB in the end (delta: -38.1MB). Peak memory consumption was 297.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 293.0s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 292.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 62 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp518 ukn17 mio100 lsp85 div100 bol100 ite100 ukn100 eq169 hnf98 smp100 dnf160 smp40 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms 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.3s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiPetriNetCegarLoop was analyzing lasso (stem: length 4 TraceHistMax 1 loop: length 3 TraceHistMax 2),while LassoBuilder was applying LassoPartitioneer to lasso for termination ,while CnfTransformerHelper was XNF transformer was simplifying 94864 disjunctions. . * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 29 PlacesAfterwards, 33 TransitionsBefore, 19 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 598 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 474, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 357, independent: 345, independent conditional: 0, independent unconditional: 345, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 357, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 474, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 357, unknown conditional: 0, unknown unconditional: 357] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown