/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:20:14,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:20:15,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:20:15,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:20:15,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:20:15,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:20:15,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:20:15,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:20:15,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:20:15,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:20:15,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:20:15,065 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:20:15,065 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:20:15,066 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:20:15,066 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:20:15,066 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:20:15,066 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:20:15,067 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:20:15,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:20:15,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:20:15,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:20:15,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:20:15,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:20:15,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:20:15,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:20:15,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:20:15,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:20:15,075 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:20:15,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:20:15,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:20:15,076 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:20:15,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:20:15,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:20:15,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:20:15,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:20:15,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:20:15,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:20:15,086 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:20:15,086 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:20:15,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:20:15,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:20:15,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:20:15,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 01:20:15,386 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 01:20:15,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2024-02-10 01:20:16,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 01:20:17,092 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 01:20:17,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2024-02-10 01:20:17,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535b549fc/b4b323b93eeb4c349410d201a4ccdeb5/FLAG5d2f82835 [2024-02-10 01:20:17,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535b549fc/b4b323b93eeb4c349410d201a4ccdeb5 [2024-02-10 01:20:17,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:20:17,123 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 01:20:17,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 01:20:17,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 01:20:17,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 01:20:17,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8a10f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17, skipping insertion in model container [2024-02-10 01:20:17,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 01:20:17,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:20:17,316 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 01:20:17,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:20:17,339 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 01:20:17,339 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 01:20:17,344 INFO L206 MainTranslator]: Completed translation [2024-02-10 01:20:17,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17 WrapperNode [2024-02-10 01:20:17,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 01:20:17,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:20:17,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:20:17,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:20:17,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,386 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 70 [2024-02-10 01:20:17,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:20:17,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:20:17,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:20:17,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:20:17,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:20:17,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:20:17,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:20:17,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:20:17,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (1/1) ... [2024-02-10 01:20:17,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:17,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:17,458 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) [2024-02-10 01:20:17,460 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 [2024-02-10 01:20:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 01:20:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:20:17,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:20:17,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:20:17,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 01:20:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 01:20:17,510 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:20:17,599 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:20:17,601 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:20:17,778 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:20:17,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:20:17,823 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 01:20:17,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:20:17 BoogieIcfgContainer [2024-02-10 01:20:17,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:20:17,826 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:20:17,826 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:20:17,835 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:20:17,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:20:17,836 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 01:20:17" (1/3) ... [2024-02-10 01:20:17,837 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55ac2104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:20:17, skipping insertion in model container [2024-02-10 01:20:17,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:20:17,837 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:20:17" (2/3) ... [2024-02-10 01:20:17,837 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55ac2104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:20:17, skipping insertion in model container [2024-02-10 01:20:17,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:20:17,838 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:20:17" (3/3) ... [2024-02-10 01:20:17,839 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-figure1.wvr.c [2024-02-10 01:20:17,905 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:20:17,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 172 flow [2024-02-10 01:20:17,969 INFO L124 PetriNetUnfolderBase]: 5/75 cut-off events. [2024-02-10 01:20:17,969 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:20:17,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 5/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-02-10 01:20:17,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 79 transitions, 172 flow [2024-02-10 01:20:17,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 75 transitions, 162 flow [2024-02-10 01:20:17,991 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:20:17,991 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:20:17,991 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:20:17,991 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:20:17,991 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:20:17,991 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:20:17,991 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:20:17,991 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:20:17,992 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:20:17,994 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 77 places, 75 transitions, 162 flow [2024-02-10 01:20:18,034 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 530 states, 529 states have (on average 2.665406427221172) internal successors, (1410), 529 states have internal predecessors, (1410), 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) [2024-02-10 01:20:18,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 530 states, 529 states have (on average 2.665406427221172) internal successors, (1410), 529 states have internal predecessors, (1410), 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) [2024-02-10 01:20:18,091 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 345 [2024-02-10 01:20:18,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:20:18,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:20:18,098 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:20:18,098 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:20:18,098 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 77 places, 75 transitions, 162 flow [2024-02-10 01:20:18,111 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 530 states, 529 states have (on average 2.665406427221172) internal successors, (1410), 529 states have internal predecessors, (1410), 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) [2024-02-10 01:20:18,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 530 states, 529 states have (on average 2.665406427221172) internal successors, (1410), 529 states have internal predecessors, (1410), 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) [2024-02-10 01:20:18,121 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 345 [2024-02-10 01:20:18,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:20:18,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:20:18,144 INFO L748 eck$LassoCheckResult]: Stem: Black: 1144#[$Ultimate##0]don't care [164] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 1147#[L-1]don't care [168] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 1149#[L21]don't care [163] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 1151#[L21-1]don't care [176] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 1153#[L21-2]don't care [175] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 1155#[L21-3]don't care [151] L21-3-->L21-4: Formula: (and (= 21 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 1157#[L21-4]don't care [197] L21-4-->L38: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 1159#[L38]don't care [198] L38-->L-1-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 1161#[L-1-1]don't care [183] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1163#[L-1-2]don't care [186] L-1-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] 1165#[L62]don't care [191] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1167#[L62-1]don't care [180] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1169#[L62-2]don't care [162] L62-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 1171#[L64]don't care [152] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 1173#[L64-1]don't care [185] L64-1-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 1175#[L67]don't care [181] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 1177#[L67-1]don't care [156] L67-1-->L67-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1179#[L67-2]don't care [144] L67-2-->L67-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 1181#[L67-3]don't care [230] L67-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1183#[$Ultimate##0, L67-4]don't care [203] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1187#[L41-4, L67-4]don't care [2024-02-10 01:20:18,144 INFO L750 eck$LassoCheckResult]: Loop: 1187#[L41-4, L67-4]don't care [204] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 1193#[L42, L67-4]don't care [207] L42-->L44: Formula: (= (+ v_~counter~0_13 1) v_~counter~0_12) InVars {~counter~0=v_~counter~0_13} OutVars{~counter~0=v_~counter~0_12, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post2] 1205#[L67-4, L44]don't care [209] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1221#[L41-2, L67-4]don't care [211] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1241#[L41-3, L67-4]don't care [213] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1187#[L41-4, L67-4]don't care [2024-02-10 01:20:18,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash 505019454, now seen corresponding path program 1 times [2024-02-10 01:20:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556850907] [2024-02-10 01:20:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:18,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:20:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:18,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:20:18,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash 223401775, now seen corresponding path program 1 times [2024-02-10 01:20:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:18,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619946358] [2024-02-10 01:20:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:18,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:20:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:18,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:20:18,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1143732498, now seen corresponding path program 1 times [2024-02-10 01:20:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:18,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804168310] [2024-02-10 01:20:18,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:18,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:18,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:20:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:18,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:20:18,586 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:20:18,587 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:20:18,587 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:20:18,587 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:20:18,587 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:20:18,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:18,588 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:20:18,588 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:20:18,588 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration1_Loop [2024-02-10 01:20:18,588 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:20:18,588 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:20:18,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:18,747 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:20:18,748 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:20:18,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:18,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:18,753 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) [2024-02-10 01:20:18,767 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 [2024-02-10 01:20:18,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:18,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:18,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:20:18,790 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:20:18,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:20:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:18,800 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) [2024-02-10 01:20:18,801 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 [2024-02-10 01:20:18,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:18,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:18,823 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 [2024-02-10 01:20:18,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:18,830 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) [2024-02-10 01:20:18,832 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 [2024-02-10 01:20:18,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:20:18,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:18,968 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:20:18,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 01:20:18,997 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:20:18,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:20:18,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:20:18,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:20:18,998 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:20:18,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:18,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:20:18,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:20:18,998 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration1_Loop [2024-02-10 01:20:18,998 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:20:18,998 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:20:19,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:19,138 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:20:19,142 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:20:19,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:19,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:19,165 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) [2024-02-10 01:20:19,220 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 [2024-02-10 01:20:19,223 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 [2024-02-10 01:20:19,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:19,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:19,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:19,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:19,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:20:19,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:20:19,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:19,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 01:20:19,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:19,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:19,258 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) [2024-02-10 01:20:19,264 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 [2024-02-10 01:20:19,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:19,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:19,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:19,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:19,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:20:19,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:20:19,279 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 [2024-02-10 01:20:19,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:19,308 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 [2024-02-10 01:20:19,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:19,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:19,317 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) [2024-02-10 01:20:19,328 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 [2024-02-10 01:20:19,329 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 [2024-02-10 01:20:19,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:19,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:19,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:19,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:19,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:20:19,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:20:19,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:19,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 01:20:19,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:19,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:19,393 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) [2024-02-10 01:20:19,427 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 [2024-02-10 01:20:19,428 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 [2024-02-10 01:20:19,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:19,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:20:19,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:19,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:19,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:19,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:20:19,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:20:19,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:20:19,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 01:20:19,454 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 01:20:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:19,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:19,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:20:19,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:20:19,460 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:20:19,460 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:20:19,461 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread1Thread1of1ForFork1_~i~0) = 1*~N~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2024-02-10 01:20:19,464 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 [2024-02-10 01:20:19,477 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:20:19,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:19,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:20:19,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:20:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:19,591 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:20:19,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:20:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:20:19,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-10 01:20:19,698 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:20:20,029 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 1399 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 01:20:20,030 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:20:20,031 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:20:20,056 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:20:20,056 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:20:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-10 01:20:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:20:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 527 transitions. [2024-02-10 01:20:20,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 527 transitions. Stem has 20 letters. Loop has 5 letters. [2024-02-10 01:20:20,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:20,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 527 transitions. Stem has 25 letters. Loop has 5 letters. [2024-02-10 01:20:20,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:20,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 527 transitions. Stem has 20 letters. Loop has 10 letters. [2024-02-10 01:20:20,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:20,070 INFO L428 stractBuchiCegarLoop]: Abstraction has has 103 places, 2646 transitions, 10986 flow [2024-02-10 01:20:20,070 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:20:20,070 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:20:20,070 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 103 places, 2646 transitions, 10986 flow [2024-02-10 01:20:20,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 01:20:20,305 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1813 states, 1804 states have (on average 3.1031042128603104) internal successors, (5598), 1812 states have internal predecessors, (5598), 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) [2024-02-10 01:20:20,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1813 states, 1804 states have (on average 3.1031042128603104) internal successors, (5598), 1812 states have internal predecessors, (5598), 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) [2024-02-10 01:20:20,349 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 430 [2024-02-10 01:20:20,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:20:20,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:20:20,355 INFO L748 eck$LassoCheckResult]: Stem: Black: 2327#[$Ultimate##0]don't care [164] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] Black: 2330#[L-1]don't care [168] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] Black: 2335#[L21]don't care [163] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] Black: 2343#[L21-1]don't care [176] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] Black: 2351#[L21-2]don't care [175] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] Black: 2359#[L21-3]don't care [151] L21-3-->L21-4: Formula: (and (= 21 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] Black: 2367#[L21-4]don't care [197] L21-4-->L38: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] Black: 2375#[L38]don't care [198] L38-->L-1-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] Black: 2383#[L-1-1]don't care [183] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] Black: 2391#[L-1-2]don't care [186] L-1-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] Black: 2399#[L62]don't care [191] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] Black: 2407#[L62-1]don't care [180] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] Black: 2415#[L62-2]don't care [162] L62-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] Black: 2423#[L64]don't care [152] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] Black: 2431#[L64-1]don't care [185] L64-1-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] Black: 2439#[L67]don't care [181] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] Black: 2447#[L67-1]don't care [156] L67-1-->L67-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] Black: 2455#[L67-2]don't care [144] L67-2-->L67-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] Black: 2463#[L67-3]don't care [230] L67-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] Black: 2471#[$Ultimate##0, L67-4]don't care [177] L67-4-->L67-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] Black: 2482#[L67-5, $Ultimate##0]don't care [135] L67-5-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] Black: 2511#[$Ultimate##0, L68]don't care [182] L68-->L68-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] Black: 2562#[$Ultimate##0, L68-1]don't care [155] L68-1-->L68-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] Black: 2630#[$Ultimate##0, L68-2]don't care [140] L68-2-->L68-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] Black: 2708#[$Ultimate##0, L68-3]don't care [227] L68-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] Black: 2799#[L68-4, $Ultimate##0, $Ultimate##0]don't care [214] $Ultimate##0-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 2905#[L51-4, L68-4, $Ultimate##0]don't care [2024-02-10 01:20:20,356 INFO L750 eck$LassoCheckResult]: Loop: 2905#[L51-4, L68-4, $Ultimate##0]don't care [215] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_4) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] Black: 3034#[L68-4, $Ultimate##0, L52]don't care [218] L52-->L55: Formula: (and (not (= (ite (< 0 v_~counter~0_35) 1 0) 0)) (= (+ v_~counter~0_34 1) v_~counter~0_35)) InVars {~counter~0=v_~counter~0_35} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~counter~0=v_~counter~0_34, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4#1] 3211#[L55, L68-4, $Ultimate##0]don't care [220] L55-->L51-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post3#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] Black: 3496#[L68-4, $Ultimate##0, L51-2]don't care [222] L51-2-->L51-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post3#1_3| 1) |v_thread2Thread1of1ForFork0_~i~1#1_11|) InVars {thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 3894#[L68-4, $Ultimate##0, L51-3]don't care [224] L51-3-->L51-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] Black: 2910#[L51-4, L68-4, $Ultimate##0]don't care [215] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_4) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] 3024#[L68-4, $Ultimate##0, L52]don't care [218] L52-->L55: Formula: (and (not (= (ite (< 0 v_~counter~0_35) 1 0) 0)) (= (+ v_~counter~0_34 1) v_~counter~0_35)) InVars {~counter~0=v_~counter~0_35} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~counter~0=v_~counter~0_34, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4#1] Black: 3213#[L55, L68-4, $Ultimate##0]don't care [220] L55-->L51-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post3#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] 3494#[L68-4, $Ultimate##0, L51-2]don't care [222] L51-2-->L51-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post3#1_3| 1) |v_thread2Thread1of1ForFork0_~i~1#1_11|) InVars {thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] Black: 3896#[L68-4, $Ultimate##0, L51-3]don't care [224] L51-3-->L51-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] 2905#[L51-4, L68-4, $Ultimate##0]don't care [2024-02-10 01:20:20,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1790501399, now seen corresponding path program 1 times [2024-02-10 01:20:20,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:20,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202104816] [2024-02-10 01:20:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:20,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:20:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:20,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:20:20,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1333992543, now seen corresponding path program 1 times [2024-02-10 01:20:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058500785] [2024-02-10 01:20:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:20,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:20:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:20,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:20:20,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -961895881, now seen corresponding path program 1 times [2024-02-10 01:20:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605037275] [2024-02-10 01:20:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-10 01:20:20,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:20:20,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605037275] [2024-02-10 01:20:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605037275] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:20:20,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:20:20,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-10 01:20:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467318438] [2024-02-10 01:20:20,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:20:20,655 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:20:20,655 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:20:20,655 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:20:20,655 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:20:20,655 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:20:20,655 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,655 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:20:20,656 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:20:20,656 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration2_Loop [2024-02-10 01:20:20,656 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:20:20,656 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:20:20,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,756 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:20:20,756 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:20:20,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:20,757 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:20,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:20,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:20,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:20:20,782 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:20:20,782 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_#t~post4#1=0} Honda state: {thread2Thread1of1ForFork0_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:20:20,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:20,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:20,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:20,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:20,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:20,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:20:20,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:20:20,818 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:20:20,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:20,827 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:20,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:20,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:20,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 01:20:20,853 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:20:20,853 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:20:20,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:20,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:20,861 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:20,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:20,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:20,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 01:20:20,886 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:20:20,886 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=0} Honda state: {thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:20:20,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:20,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:20,894 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:20,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:20,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:20,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 01:20:20,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:20,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:20,939 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:20,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 01:20:20,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:20:20,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:20,969 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:20:20,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:20,974 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:20:20,974 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:20:20,974 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:20:20,974 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:20:20,974 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:20:20,975 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:20,975 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:20:20,975 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:20:20,975 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration2_Loop [2024-02-10 01:20:20,975 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:20:20,975 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:20:20,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:20,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:21,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:21,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:21,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:21,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:21,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:20:21,083 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:20:21,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:21,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:21,086 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:21,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 01:20:21,090 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 [2024-02-10 01:20:21,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:21,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:21,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:21,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:21,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:20:21,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:20:21,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:21,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:21,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:21,141 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:21,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 01:20:21,187 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 [2024-02-10 01:20:21,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:21,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:20:21,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:21,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:21,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:21,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:20:21,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:20:21,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:21,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:21,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:21,215 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:21,221 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 [2024-02-10 01:20:21,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:21,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:20:21,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:21,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:21,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:21,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:20:21,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:20:21,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 01:20:21,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:21,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:21,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:21,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:21,248 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:21,253 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 [2024-02-10 01:20:21,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:21,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:21,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:21,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:21,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:20:21,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:20:21,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 01:20:21,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:21,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:21,282 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:21,290 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 [2024-02-10 01:20:21,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:21,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:20:21,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:21,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:21,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:21,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:20:21,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:20:21,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-10 01:20:21,310 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:20:21,313 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 01:20:21,313 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:20:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:21,315 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:21,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:20:21,322 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:20:21,322 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:20:21,322 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2024-02-10 01:20:21,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-10 01:20:21,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:21,330 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:20:21,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:21,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:20:21,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:20:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:21,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:20:21,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:20:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:20:21,454 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:20:21,454 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2024-02-10 01:20:21,484 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 7 states and 759 transitions.5 powerset states2 rank states. The highest rank that occured is 1 [2024-02-10 01:20:21,484 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:20:21,485 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:20:21,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:21,826 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:20:21,826 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:20:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-02-10 01:20:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2024-02-10 01:20:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2024-02-10 01:20:21,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 312 transitions. Stem has 26 letters. Loop has 10 letters. [2024-02-10 01:20:21,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:21,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 312 transitions. Stem has 36 letters. Loop has 10 letters. [2024-02-10 01:20:21,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:21,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 312 transitions. Stem has 26 letters. Loop has 20 letters. [2024-02-10 01:20:21,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:20:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-10 01:20:21,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-10 01:20:21,859 INFO L175 Difference]: Start difference. First operand has 117 places, 51444 transitions, 316704 flow. Second operand 3 states and 237 transitions. [2024-02-10 01:20:21,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 51444 transitions, 316704 flow. Second operand 3 states and 237 transitions. [2024-02-10 01:20:21,861 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 79 [2024-02-10 01:20:21,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:20:41,155 INFO L124 PetriNetUnfolderBase]: 18159/24844 cut-off events. [2024-02-10 01:20:41,155 INFO L125 PetriNetUnfolderBase]: For 985/985 co-relation queries the response was YES. [2024-02-10 01:20:41,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76149 conditions, 24844 events. 18159/24844 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 123141 event pairs, 32 based on Foata normal form. 517/14205 useless extension candidates. Maximal degree in co-relation 67575. Up to 6249 conditions per place. [2024-02-10 01:20:41,328 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 61 selfloop transitions, 36 changer transitions 25/2563 dead transitions. [2024-02-10 01:20:41,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 2563 transitions, 15920 flow [2024-02-10 01:20:41,343 INFO L231 Difference]: Finished difference. Result has 120 places, 2538 transitions, 15752 flow [2024-02-10 01:20:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-10 01:20:41,345 INFO L428 stractBuchiCegarLoop]: Abstraction has has 120 places, 2538 transitions, 15752 flow [2024-02-10 01:20:41,346 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:20:41,346 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:20:41,346 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 120 places, 2538 transitions, 15752 flow [2024-02-10 01:20:42,629 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 6657 states, 6530 states have (on average 3.798468606431853) internal successors, (24804), 6656 states have internal predecessors, (24804), 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) [2024-02-10 01:20:42,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6657 states, 6530 states have (on average 3.798468606431853) internal successors, (24804), 6656 states have internal predecessors, (24804), 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) [2024-02-10 01:20:42,754 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 390 [2024-02-10 01:20:42,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:20:42,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:20:42,757 INFO L748 eck$LassoCheckResult]: Stem: Black: 7379#[$Ultimate##0]don't care [164] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] Black: 7382#[L-1]don't care [168] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] Black: 7393#[L21]don't care [163] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] Black: 7412#[L21-1]don't care [176] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] Black: 7434#[L21-2]don't care [175] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] Black: 7456#[L21-3]don't care [151] L21-3-->L21-4: Formula: (and (= 21 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] Black: 7478#[L21-4]don't care [197] L21-4-->L38: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] Black: 7500#[L38]don't care [198] L38-->L-1-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] Black: 7522#[L-1-1]don't care [183] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] Black: 7549#[L-1-2]don't care [186] L-1-2-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] Black: 7574#[L62]don't care [191] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] Black: 7596#[L62-1]don't care [180] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] Black: 7618#[L62-2]don't care [162] L62-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] Black: 7640#[L64]don't care [152] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] Black: 7662#[L64-1]don't care [185] L64-1-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] Black: 7684#[L67]don't care [181] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] Black: 7706#[L67-1]don't care [156] L67-1-->L67-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] Black: 7728#[L67-2]don't care [144] L67-2-->L67-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] Black: 7750#[L67-3]don't care [230] L67-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] Black: 7772#[L67-4, $Ultimate##0]don't care [177] L67-4-->L67-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] Black: 7794#[L67-5, $Ultimate##0]don't care [135] L67-5-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] Black: 7822#[L68, $Ultimate##0]don't care [182] L68-->L68-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] Black: 7883#[L68-1, $Ultimate##0]don't care [203] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] Black: 7992#[L41-4, L68-1]don't care [155] L68-1-->L68-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] Black: 8178#[L41-4, L68-2]don't care [140] L68-2-->L68-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] Black: 8405#[L41-4, L68-3]don't care [227] L68-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] Black: 8669#[L41-4, $Ultimate##0, L68-4]don't care [214] $Ultimate##0-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] Black: 8986#[L41-4, L68-4, L51-4]don't care [204] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] Black: 9445#[L42, L68-4, L51-4]don't care [207] L42-->L44: Formula: (= (+ v_~counter~0_13 1) v_~counter~0_12) InVars {~counter~0=v_~counter~0_13} OutVars{~counter~0=v_~counter~0_12, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post2] 10139#[L44, L51-4, L68-4]don't care [2024-02-10 01:20:42,758 INFO L750 eck$LassoCheckResult]: Loop: 10139#[L44, L51-4, L68-4]don't care [215] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_4) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] Black: 11107#[L52, L44, L68-4]don't care [218] L52-->L55: Formula: (and (not (= (ite (< 0 v_~counter~0_35) 1 0) 0)) (= (+ v_~counter~0_34 1) v_~counter~0_35)) InVars {~counter~0=v_~counter~0_35} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~counter~0=v_~counter~0_34, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4#1] 12276#[L44, L55, L68-4]don't care [220] L55-->L51-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post3#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] Black: 13655#[L44, L51-2, L68-4]don't care [222] L51-2-->L51-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post3#1_3| 1) |v_thread2Thread1of1ForFork0_~i~1#1_11|) InVars {thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 15190#[L51-3, L44, L68-4]don't care [224] L51-3-->L51-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] Black: 16802#[L44, L51-4, L68-4]don't care [215] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_4) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] 10548#[L44, L52, L68-4]don't care [218] L52-->L55: Formula: (and (not (= (ite (< 0 v_~counter~0_35) 1 0) 0)) (= (+ v_~counter~0_34 1) v_~counter~0_35)) InVars {~counter~0=v_~counter~0_35} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~counter~0=v_~counter~0_34, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4#1] Black: 11508#[L44, L55, L68-4]don't care [220] L55-->L51-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_9| |v_thread2Thread1of1ForFork0_#t~post3#1_1|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] 12666#[L44, L51-2, L68-4]don't care [222] L51-2-->L51-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post3#1_3| 1) |v_thread2Thread1of1ForFork0_~i~1#1_11|) InVars {thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] Black: 13964#[L51-3, L44, L68-4]don't care [224] L51-3-->L51-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3#1] 10139#[L44, L51-4, L68-4]don't care [2024-02-10 01:20:42,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1628522719, now seen corresponding path program 1 times [2024-02-10 01:20:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154447260] [2024-02-10 01:20:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:42,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:20:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:42,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:20:42,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1333992543, now seen corresponding path program 2 times [2024-02-10 01:20:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781306575] [2024-02-10 01:20:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:42,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:20:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:20:42,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:20:42,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash 552021759, now seen corresponding path program 1 times [2024-02-10 01:20:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:20:42,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18367170] [2024-02-10 01:20:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:20:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:20:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:20:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:20:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18367170] [2024-02-10 01:20:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18367170] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:20:42,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:20:42,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-10 01:20:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672430593] [2024-02-10 01:20:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:20:42,946 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:20:42,947 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:20:42,947 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:20:42,947 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:20:42,947 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:20:42,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:42,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:20:42,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:20:42,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration3_Loop [2024-02-10 01:20:42,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:20:42,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:20:42,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:42,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,013 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:20:43,014 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:20:43,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:43,015 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:20:43,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-10 01:20:43,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:43,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:43,067 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:20:43,067 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_5=-1} Honda state: {v_rep#funAddr~thread1.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:20:43,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:43,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:43,073 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2024-02-10 01:20:43,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-02-10 01:20:43,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:20:43,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:43,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-02-10 01:20:43,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:43,103 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2024-02-10 01:20:43,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-02-10 01:20:43,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:20:43,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:20:43,313 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:20:43,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:43,318 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:20:43,318 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:20:43,318 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:20:43,318 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:20:43,318 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:20:43,318 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,318 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:20:43,318 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:20:43,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-figure1.wvr.c_BEv2_Iteration3_Loop [2024-02-10 01:20:43,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:20:43,318 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:20:43,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:20:43,403 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:20:43,403 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:20:43,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:43,421 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2024-02-10 01:20:43,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-02-10 01:20:43,425 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 [2024-02-10 01:20:43,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:43,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:43,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:43,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:43,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:20:43,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:20:43,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:43,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:43,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:43,505 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2024-02-10 01:20:43,592 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 [2024-02-10 01:20:43,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-02-10 01:20:43,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:43,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:43,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:43,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:43,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:20:43,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:20:43,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:20:43,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-02-10 01:20:43,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:43,662 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2024-02-10 01:20:43,665 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 [2024-02-10 01:20:43,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:20:43,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:20:43,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:20:43,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:20:43,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:20:43,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:20:43,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:20:43,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-02-10 01:20:43,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:20:43,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 01:20:43,694 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 01:20:43,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:20:43,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:20:43,713 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2024-02-10 01:20:43,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:20:43,717 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:20:43,717 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:20:43,717 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread2Thread1of1ForFork0_~i~1#1) = 1*~N~0 - 1*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [] [2024-02-10 01:20:43,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-02-10 01:20:43,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-02-10 01:20:43,725 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:20:43,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:20:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:43,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:20:43,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:20:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:20:43,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-10 01:20:43,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:20:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:20:43,865 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-02-10 01:20:43,865 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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) [2024-02-10 01:20:44,043 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 15 states and 1628 transitions.9 powerset states6 rank states. The highest rank that occured is 1 [2024-02-10 01:20:44,044 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:20:44,044 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:20:44,812 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:20:44,813 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:20:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-02-10 01:20:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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) [2024-02-10 01:20:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 603 transitions. [2024-02-10 01:20:44,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 603 transitions. Stem has 29 letters. Loop has 10 letters. [2024-02-10 01:20:44,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:44,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 603 transitions. Stem has 39 letters. Loop has 10 letters. [2024-02-10 01:20:44,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:44,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 603 transitions. Stem has 29 letters. Loop has 20 letters. [2024-02-10 01:20:44,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:20:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:20:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-10 01:20:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-10 01:20:44,853 INFO L175 Difference]: Start difference. First operand has 150 places, 105772 transitions, 864172 flow. Second operand 4 states and 316 transitions. [2024-02-10 01:20:44,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 105772 transitions, 864172 flow. Second operand 4 states and 316 transitions. [2024-02-10 01:20:44,855 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 79 [2024-02-10 01:20:44,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:20:47,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-02-10 01:24:44,649 INFO L124 PetriNetUnfolderBase]: 84424/112312 cut-off events. [2024-02-10 01:24:44,649 INFO L125 PetriNetUnfolderBase]: For 5185/5185 co-relation queries the response was YES. [2024-02-10 01:24:44,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459367 conditions, 112312 events. 84424/112312 cut-off events. For 5185/5185 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 621045 event pairs, 12 based on Foata normal form. 574/57534 useless extension candidates. Maximal degree in co-relation 384968. Up to 27104 conditions per place. [2024-02-10 01:24:45,198 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 259 selfloop transitions, 412 changer transitions 105/11438 dead transitions. [2024-02-10 01:24:45,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 11438 transitions, 94870 flow [2024-02-10 01:24:45,253 INFO L231 Difference]: Finished difference. Result has 155 places, 11333 transitions, 94895 flow [2024-02-10 01:24:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-10 01:24:45,254 INFO L428 stractBuchiCegarLoop]: Abstraction has has 155 places, 11333 transitions, 94895 flow [2024-02-10 01:24:45,254 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:24:45,254 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:24:45,254 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 155 places, 11333 transitions, 94895 flow Received shutdown request... [2024-02-10 01:24:48,977 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:24:48,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:24:48 BoogieIcfgContainer [2024-02-10 01:24:48,982 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:24:48,983 INFO L158 Benchmark]: Toolchain (without parser) took 271859.60ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 191.9MB in the beginning and 913.8MB in the end (delta: -721.9MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2024-02-10 01:24:48,984 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 158.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:24:48,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.91ms. Allocated memory is still 218.1MB. Free memory was 191.5MB in the beginning and 181.0MB in the end (delta: 10.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 01:24:48,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.18ms. Allocated memory is still 218.1MB. Free memory was 180.5MB in the beginning and 179.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:24:48,987 INFO L158 Benchmark]: Boogie Preprocessor took 30.49ms. Allocated memory is still 218.1MB. Free memory was 179.4MB in the beginning and 177.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:24:48,987 INFO L158 Benchmark]: RCFGBuilder took 405.55ms. Allocated memory is still 218.1MB. Free memory was 177.9MB in the beginning and 163.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-02-10 01:24:48,987 INFO L158 Benchmark]: BuchiAutomizer took 271156.04ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 163.2MB in the beginning and 913.8MB in the end (delta: -750.6MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2024-02-10 01:24:48,987 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:24:48,990 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 158.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.91ms. Allocated memory is still 218.1MB. Free memory was 191.5MB in the beginning and 181.0MB in the end (delta: 10.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.18ms. Allocated memory is still 218.1MB. Free memory was 180.5MB in the beginning and 179.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.49ms. Allocated memory is still 218.1MB. Free memory was 179.4MB in the beginning and 177.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 405.55ms. Allocated memory is still 218.1MB. Free memory was 177.9MB in the beginning and 163.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 271156.04ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 163.2MB in the beginning and 913.8MB in the end (delta: -750.6MB). Peak memory consumption was 2.0GB. 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function ((-1 * i) + N) and consists of 7 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function (N + (-1 * i)) and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 94895 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 271.0s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 3.3s. Construction of modules took 0.2s. Büchi inclusion checks took 261.8s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/10 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1180 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1177 mSDsluCounter, 2460 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1530 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 469 IncrementalHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 930 mSDtfsCounter, 469 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax281 hnf100 lsp21 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 106ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown