/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/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:00:14,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:00:14,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:00:14,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:00:14,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:00:14,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:00:14,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:00:14,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:00:14,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:00:14,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:00:14,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:00:14,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:00:14,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:00:14,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:00:14,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:00:14,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:00:14,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:00:14,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:00:14,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:00:14,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:00:14,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:00:14,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:00:14,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:00:14,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:00:14,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:00:14,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:00:14,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:00:14,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:00:14,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:00:14,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:00:14,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:00:14,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:00:14,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:00:14,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:00:14,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:00:14,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:00:14,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:00:14,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:00:14,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:00:14,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:00:14,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:00:14,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-09-29 15:00:14,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:00:14,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:00:14,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:00:14,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:00:14,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:00:14,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:00:14,877 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:00:14,877 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:00:14,877 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:00:14,877 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:00:14,878 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:00:14,878 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:00:14,878 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:00:14,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:00:14,878 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:00:14,878 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:00:14,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:00:14,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:00:14,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:00:14,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:00:14,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:00:14,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:00:14,880 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:00:14,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:00:14,880 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:00:14,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:00:14,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:00:14,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:00:14,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:00:14,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:00:14,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:00:14,882 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:00:14,882 INFO L138 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 [2022-09-29 15:00:15,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:00:15,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:00:15,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:00:15,155 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:00:15,156 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:00:15,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl [2022-09-29 15:00:15,158 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs-nonatomic.bpl' [2022-09-29 15:00:15,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:00:15,185 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:00:15,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:15,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:00:15,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:00:15,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,206 INFO L137 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:00:15,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:15,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:00:15,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:00:15,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:00:15,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:00:15,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:00:15,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:00:15,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:00:15,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/1) ... [2022-09-29 15:00:15,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:15,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:15,269 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) [2022-09-29 15:00:15,291 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 [2022-09-29 15:00:15,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2022-09-29 15:00:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2022-09-29 15:00:15,307 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2022-09-29 15:00:15,307 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:00:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:00:15,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:00:15,307 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2022-09-29 15:00:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2022-09-29 15:00:15,307 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2022-09-29 15:00:15,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2022-09-29 15:00:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2022-09-29 15:00:15,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2022-09-29 15:00:15,308 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2022-09-29 15:00:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2022-09-29 15:00:15,309 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2022-09-29 15:00:15,309 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 15:00:15,350 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:00:15,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:00:15,446 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:00:15,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:00:15,453 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-09-29 15:00:15,455 INFO L202 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:15 BoogieIcfgContainer [2022-09-29 15:00:15,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:00:15,456 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:00:15,456 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:00:15,462 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:00:15,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:15,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:15" (1/2) ... [2022-09-29 15:00:15,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6357fb99 and model type min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:00:15, skipping insertion in model container [2022-09-29 15:00:15,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:15,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:15" (2/2) ... [2022-09-29 15:00:15,481 INFO L322 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs-nonatomic.bpl [2022-09-29 15:00:15,593 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-09-29 15:00:15,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 126 flow [2022-09-29 15:00:15,683 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:15,683 INFO L123 PetriNetUnfolderBase]: 6/39 cut-off events. [2022-09-29 15:00:15,683 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:00:15,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-09-29 15:00:15,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 47 transitions, 126 flow [2022-09-29 15:00:15,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 102 flow [2022-09-29 15:00:15,696 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:00:15,717 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 102 flow [2022-09-29 15:00:15,722 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 102 flow [2022-09-29 15:00:15,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 102 flow [2022-09-29 15:00:15,737 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:15,738 INFO L123 PetriNetUnfolderBase]: 6/39 cut-off events. [2022-09-29 15:00:15,738 INFO L124 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2022-09-29 15:00:15,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 6/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 98 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-09-29 15:00:15,741 INFO L116 LiptonReduction]: Number of co-enabled transitions 738 [2022-09-29 15:00:16,311 INFO L131 LiptonReduction]: Checked pairs total: 743 [2022-09-29 15:00:16,311 INFO L133 LiptonReduction]: Total number of compositions: 21 [2022-09-29 15:00:16,332 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:00:16,332 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:00:16,332 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:00:16,332 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:00:16,332 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:00:16,332 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:00:16,332 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:00:16,333 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 15:00:16,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 15:00:16,435 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 133 [2022-09-29 15:00:16,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:16,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:16,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-09-29 15:00:16,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:16,440 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:00:16,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 162 states, but on-demand construction may add more states [2022-09-29 15:00:16,457 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 133 [2022-09-29 15:00:16,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:16,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:16,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-09-29 15:00:16,459 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:16,463 INFO L733 eck$LassoCheckResult]: Stem: 53#[ULTIMATE.startENTRY]don't care [131] ULTIMATE.startENTRY-->computeMinENTRY: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 56#[computeMinENTRY, L79]don't care [151] computeMinENTRY-->L28-1: Formula: (and (= v_array_min_23 (select v_A_41 0)) (= v_computeMinThread1of1ForFork0_i1_33 0)) InVars {A=v_A_41} OutVars{A=v_A_41, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_33, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 60#[L28-1, L79]don't care [2022-09-29 15:00:16,463 INFO L735 eck$LassoCheckResult]: Loop: 60#[L28-1, L79]don't care [164] L28-1-->L28-1: Formula: (let ((.cse3 (let ((.cse4 (select v_A_In_1 v_computeMinThread1of1ForFork0_i1_In_1))) (ite (< .cse4 0) (- .cse4) .cse4)))) (let ((.cse0 (= (+ v_computeMinThread1of1ForFork0_i1_In_1 1) v_computeMinThread1of1ForFork0_i1_Out_2)) (.cse1 (< .cse3 v_array_min_In_1)) (.cse2 (< v_computeMinThread1of1ForFork0_i1_In_1 v_N_In_1))) (or (and .cse0 (= v_array_min_Out_2 v_array_min_In_1) (not .cse1) .cse2) (and (= v_array_min_Out_2 .cse3) .cse0 .cse1 .cse2)))) InVars {A=v_A_In_1, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_In_1, array_min=v_array_min_In_1, N=v_N_In_1} OutVars{A=v_A_In_1, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_Out_2, array_min=v_array_min_Out_2, N=v_N_In_1} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 60#[L28-1, L79]don't care [2022-09-29 15:00:16,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash 5173, now seen corresponding path program 1 times [2022-09-29 15:00:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:16,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028268604] [2022-09-29 15:00:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:16,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:16,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash 195, now seen corresponding path program 1 times [2022-09-29 15:00:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:16,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118926656] [2022-09-29 15:00:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:16,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:16,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash 160527, now seen corresponding path program 1 times [2022-09-29 15:00:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:16,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50525897] [2022-09-29 15:00:16,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:16,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:16,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:16,816 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:16,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:16,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:16,817 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:16,817 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:16,817 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:16,817 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:16,817 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:16,817 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:00:16,817 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:16,818 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:16,836 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:16,843 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:17,137 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:17,140 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:17,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:17,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:17,143 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) [2022-09-29 15:00:17,152 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 [2022-09-29 15:00:17,153 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 [2022-09-29 15:00:17,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:17,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:17,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:17,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:17,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:17,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:17,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:17,208 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 [2022-09-29 15:00:17,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:17,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:17,210 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) [2022-09-29 15:00:17,215 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 [2022-09-29 15:00:17,219 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 [2022-09-29 15:00:17,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:17,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:17,228 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-09-29 15:00:17,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:17,281 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-09-29 15:00:17,282 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-09-29 15:00:17,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:17,347 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 [2022-09-29 15:00:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:17,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:17,350 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) [2022-09-29 15:00:17,353 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 [2022-09-29 15:00:17,354 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 [2022-09-29 15:00:17,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:17,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:17,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:17,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:17,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:17,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:17,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:17,388 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-09-29 15:00:17,388 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 15:00:17,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:17,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:17,411 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) [2022-09-29 15:00:17,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:17,439 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 [2022-09-29 15:00:17,454 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:17,455 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:17,455 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2022-09-29 15:00:17,477 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 [2022-09-29 15:00:17,480 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:17,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:17,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:17,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:17,528 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-29 15:00:17,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:17,554 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 [2022-09-29 15:00:17,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 162 states, but on-demand construction may add more states Second 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) [2022-09-29 15:00:17,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 162 states, but on-demand construction may add more states. Second 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 440 states and 2010 transitions. Complement of second has 4 states. [2022-09-29 15:00:17,671 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 [2022-09-29 15:00:17,675 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) [2022-09-29 15:00:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-09-29 15:00:17,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 2 letters. Loop has 1 letters. [2022-09-29 15:00:17,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:17,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:00:17,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:17,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 2 letters. Loop has 2 letters. [2022-09-29 15:00:17,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:17,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 2010 transitions. [2022-09-29 15:00:17,702 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 124 [2022-09-29 15:00:17,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 344 states and 1581 transitions. [2022-09-29 15:00:17,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2022-09-29 15:00:17,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2022-09-29 15:00:17,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 1581 transitions. [2022-09-29 15:00:17,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:17,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 344 states and 1581 transitions. [2022-09-29 15:00:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 1581 transitions. [2022-09-29 15:00:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 269. [2022-09-29 15:00:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 269 states have (on average 4.825278810408922) internal successors, (1298), 268 states have internal predecessors, (1298), 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) [2022-09-29 15:00:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 1298 transitions. [2022-09-29 15:00:17,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 269 states and 1298 transitions. [2022-09-29 15:00:17,773 INFO L428 stractBuchiCegarLoop]: Abstraction has 269 states and 1298 transitions. [2022-09-29 15:00:17,773 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:00:17,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 1298 transitions. [2022-09-29 15:00:17,777 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 124 [2022-09-29 15:00:17,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:17,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:17,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:17,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:17,778 INFO L733 eck$LassoCheckResult]: Stem: 1369#[ULTIMATE.startENTRY]don't care [131] ULTIMATE.startENTRY-->computeMinENTRY: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 1017#[computeMinENTRY, L79]don't care [134] L79-->computeMaxENTRY: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 1019#[computeMaxENTRY, L80, computeMinENTRY]don't care [149] computeMaxENTRY-->L44-1: Formula: (and (= (select v_A_33 0) v_array_max_12) (= v_computeMaxThread1of1ForFork1_i2_19 0)) InVars {A=v_A_33} OutVars{A=v_A_33, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_19, array_max=v_array_max_12} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 1147#[L44-1, L80, computeMinENTRY]don't care [2022-09-29 15:00:17,778 INFO L735 eck$LassoCheckResult]: Loop: 1147#[L44-1, L80, computeMinENTRY]don't care [165] L44-1-->L44-1: Formula: (let ((.cse3 (let ((.cse4 (select v_A_In_3 v_computeMaxThread1of1ForFork1_i2_In_1))) (ite (< .cse4 0) (- .cse4) .cse4)))) (let ((.cse0 (= v_computeMaxThread1of1ForFork1_i2_Out_2 (+ v_computeMaxThread1of1ForFork1_i2_In_1 1))) (.cse1 (< v_computeMaxThread1of1ForFork1_i2_In_1 v_N_In_3)) (.cse2 (< v_array_max_In_1 .cse3))) (or (and (= v_array_max_In_1 v_array_max_Out_2) .cse0 .cse1 (not .cse2)) (and .cse0 .cse1 (= v_array_max_Out_2 .cse3) .cse2)))) InVars {A=v_A_In_3, N=v_N_In_3, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_In_1, array_max=v_array_max_In_1} OutVars{A=v_A_In_3, N=v_N_In_3, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_Out_2, array_max=v_array_max_Out_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 1147#[L44-1, L80, computeMinENTRY]don't care [2022-09-29 15:00:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash 159985, now seen corresponding path program 1 times [2022-09-29 15:00:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:17,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828374601] [2022-09-29 15:00:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:17,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 1 times [2022-09-29 15:00:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:17,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262151705] [2022-09-29 15:00:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 4959700, now seen corresponding path program 1 times [2022-09-29 15:00:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:17,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614370365] [2022-09-29 15:00:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:17,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:17,958 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:17,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:17,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:17,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:17,959 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:17,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:17,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:17,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:17,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs-nonatomic.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:00:17,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:17,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:17,961 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:18,023 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:18,025 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:18,028 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:18,031 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:18,195 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:18,195 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:18,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:18,197 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) [2022-09-29 15:00:18,198 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 [2022-09-29 15:00:18,229 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 [2022-09-29 15:00:18,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:18,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:18,236 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-09-29 15:00:18,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:18,260 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-09-29 15:00:18,261 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-09-29 15:00:18,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:18,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:18,328 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) [2022-09-29 15:00:18,338 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 [2022-09-29 15:00:18,339 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 [2022-09-29 15:00:18,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:18,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:18,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:18,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:18,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:18,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:18,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:18,376 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-09-29 15:00:18,376 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-09-29 15:00:18,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:18,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:18,421 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) [2022-09-29 15:00:18,431 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 [2022-09-29 15:00:18,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:18,446 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:18,446 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:18,446 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2022-09-29 15:00:18,462 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 [2022-09-29 15:00:18,467 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 [2022-09-29 15:00:18,468 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:18,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:18,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:18,516 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-09-29 15:00:18,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:18,517 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 [2022-09-29 15:00:18,517 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 1298 transitions. cyclomatic complexity: 1132 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-09-29 15:00:18,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 269 states and 1298 transitions. cyclomatic complexity: 1132. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 798 states and 4068 transitions. Complement of second has 4 states. [2022-09-29 15:00:18,586 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 [2022-09-29 15:00:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-09-29 15:00:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-09-29 15:00:18,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:00:18,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:18,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:00:18,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:18,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 15:00:18,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:18,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 798 states and 4068 transitions. [2022-09-29 15:00:18,601 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 110 [2022-09-29 15:00:18,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 798 states to 618 states and 3098 transitions. [2022-09-29 15:00:18,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2022-09-29 15:00:18,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2022-09-29 15:00:18,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 618 states and 3098 transitions. [2022-09-29 15:00:18,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:18,619 INFO L218 hiAutomatonCegarLoop]: Abstraction has 618 states and 3098 transitions. [2022-09-29 15:00:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states and 3098 transitions. [2022-09-29 15:00:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 474. [2022-09-29 15:00:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 474 states have (on average 5.187763713080169) internal successors, (2459), 473 states have internal predecessors, (2459), 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) [2022-09-29 15:00:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 2459 transitions. [2022-09-29 15:00:18,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 474 states and 2459 transitions. [2022-09-29 15:00:18,666 INFO L428 stractBuchiCegarLoop]: Abstraction has 474 states and 2459 transitions. [2022-09-29 15:00:18,666 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 15:00:18,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 474 states and 2459 transitions. [2022-09-29 15:00:18,671 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 110 [2022-09-29 15:00:18,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:18,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:18,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:18,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-09-29 15:00:18,673 INFO L733 eck$LassoCheckResult]: Stem: 3009#[ULTIMATE.startENTRY]don't care [131] ULTIMATE.startENTRY-->computeMinENTRY: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_18, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 2437#[computeMinENTRY, L79]don't care [134] L79-->computeMaxENTRY: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_18, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 2439#[computeMaxENTRY, L80, computeMinENTRY]don't care [137] L80-->L68: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 2617#[computeMaxENTRY, L81, computeMinENTRY, L68]don't care [2022-09-29 15:00:18,673 INFO L735 eck$LassoCheckResult]: Loop: 2617#[computeMaxENTRY, L81, computeMinENTRY, L68]don't care [116] L68-->L70: Formula: (= v_array_min_3 v_sampleThread1of1ForFork2_min_l_1) InVars {array_min=v_array_min_3} OutVars{array_min=v_array_min_3, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_1} AuxVars[] AssignedVars[sampleThread1of1ForFork2_min_l] 2755#[computeMaxENTRY, L81, L70, computeMinENTRY]don't care [150] L70-->L68: Formula: (and (= v_sampleThread1of1ForFork2_diff_5 (+ (* (- 1) v_sampleThread1of1ForFork2_min_l_9) v_sampleThread1of1ForFork2_max_l_9)) (= v_array_max_17 v_sampleThread1of1ForFork2_max_l_9)) InVars {array_max=v_array_max_17, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_5, array_max=v_array_max_17, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_9, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_9} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_max_l] 2617#[computeMaxENTRY, L81, computeMinENTRY, L68]don't care [2022-09-29 15:00:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash 159973, now seen corresponding path program 1 times [2022-09-29 15:00:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:18,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983840139] [2022-09-29 15:00:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:18,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:18,683 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:18,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:18,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:18,694 INFO L85 PathProgramCache]: Analyzing trace with hash 4707, now seen corresponding path program 1 times [2022-09-29 15:00:18,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:18,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156759232] [2022-09-29 15:00:18,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:18,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:18,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:18,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 153737799, now seen corresponding path program 1 times [2022-09-29 15:00:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:18,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378036888] [2022-09-29 15:00:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:18,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:18,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:18,774 INFO L202 PluginConnector]: Adding new model min-max-sample-abs-nonatomic.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 03:00:18 BoogieIcfgContainer [2022-09-29 15:00:18,775 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 15:00:18,776 INFO L158 Benchmark]: Toolchain (without parser) took 3590.26ms. Allocated memory was 180.4MB in the beginning and 292.6MB in the end (delta: 112.2MB). Free memory was 133.5MB in the beginning and 225.3MB in the end (delta: -91.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-09-29 15:00:18,776 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:00:18,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.38ms. Allocated memory is still 180.4MB. Free memory was 133.5MB in the beginning and 131.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:00:18,778 INFO L158 Benchmark]: Boogie Preprocessor took 25.59ms. Allocated memory is still 180.4MB. Free memory was 131.9MB in the beginning and 130.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:00:18,780 INFO L158 Benchmark]: RCFGBuilder took 220.39ms. Allocated memory is still 180.4MB. Free memory was 130.8MB in the beginning and 121.2MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-09-29 15:00:18,786 INFO L158 Benchmark]: BuchiAutomizer took 3318.93ms. Allocated memory was 180.4MB in the beginning and 292.6MB in the end (delta: 112.2MB). Free memory was 121.1MB in the beginning and 225.3MB in the end (delta: -104.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-09-29 15:00:18,787 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.38ms. Allocated memory is still 180.4MB. Free memory was 133.5MB in the beginning and 131.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.59ms. Allocated memory is still 180.4MB. Free memory was 131.9MB in the beginning and 130.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 220.39ms. Allocated memory is still 180.4MB. Free memory was 130.8MB in the beginning and 121.2MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3318.93ms. Allocated memory was 180.4MB in the beginning and 292.6MB in the end (delta: 112.2MB). Free memory was 121.1MB in the beginning and 225.3MB in the end (delta: -104.1MB). Peak memory consumption was 7.3MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 3 locations. The remainder module has 474 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 219 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 13 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital102 mio100 ax100 hnf100 lsp192 ukn30 mio100 lsp81 div100 bol100 ite100 ukn100 eq148 hnf97 smp100 dnf400 smp27 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 110ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 68]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {array_max=0, array_min=0, diff=0, i1=0, i2=0, max_l=0, min_l=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 68]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L79] FORK 0 fork 1 computeMin(); [L80] FORK 0 fork 2, 2 computeMax(); [L81] FORK 0 fork 3, 3, 3 sample(); Loop: [L69] min_l := array_min; [L70] max_l := array_max; [L72] diff := max_l - min_l; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 46 PlacesBefore, 31 PlacesAfterwards, 39 TransitionsBefore, 22 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 743 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 635, positive: 625, positive conditional: 0, positive unconditional: 625, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 455, positive: 446, positive conditional: 0, positive unconditional: 446, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 455, positive: 438, positive conditional: 0, positive unconditional: 438, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 635, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 455, unknown conditional: 0, unknown unconditional: 455] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 RESULT: Ultimate proved your program to be incorrect! [2022-09-29 15:00:18,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:19,034 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...