/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 -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:43:16,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:43:16,511 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-09 23:43:16,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:43:16,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:43:16,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:43:16,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:43:16,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:43:16,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:43:16,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:43:16,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:43:16,534 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:43:16,534 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:43:16,534 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:43:16,534 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:43:16,535 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:43:16,535 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:43:16,535 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:43:16,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:43:16,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:43:16,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:43:16,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:43:16,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:43:16,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:43:16,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:43:16,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:43:16,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:43:16,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:43:16,537 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:43:16,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:43:16,538 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:43:16,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:43:16,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:43:16,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:43:16,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:43:16,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:43:16,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:43:16,539 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:43:16,539 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 [2024-02-09 23:43:16,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:43:16,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:43:16,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:43:16,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-09 23:43:16,854 INFO L274 PluginConnector]: CDTParser initialized [2024-02-09 23:43:16,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2024-02-09 23:43:18,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-09 23:43:18,166 INFO L384 CDTParser]: Found 1 translation units. [2024-02-09 23:43:18,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2024-02-09 23:43:18,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd03b01c/bb05acff4636494ca9df63e0f74a3ca9/FLAG4ca9d8a50 [2024-02-09 23:43:18,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd03b01c/bb05acff4636494ca9df63e0f74a3ca9 [2024-02-09 23:43:18,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:43:18,188 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-09 23:43:18,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-09 23:43:18,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-09 23:43:18,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-09 23:43:18,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278d32d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18, skipping insertion in model container [2024-02-09 23:43:18,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,216 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-09 23:43:18,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:43:18,371 INFO L202 MainTranslator]: Completed pre-run [2024-02-09 23:43:18,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:43:18,391 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:43:18,391 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:43:18,397 INFO L206 MainTranslator]: Completed translation [2024-02-09 23:43:18,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18 WrapperNode [2024-02-09 23:43:18,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-09 23:43:18,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:43:18,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:43:18,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:43:18,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,422 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 54 [2024-02-09 23:43:18,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:43:18,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:43:18,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:43:18,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:43:18,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:43:18,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:43:18,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:43:18,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:43:18,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (1/1) ... [2024-02-09 23:43:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:18,466 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-09 23:43:18,469 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-09 23:43:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-09 23:43:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-09 23:43:18,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-09 23:43:18,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:43:18,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:43:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-09 23:43:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-09 23:43:18,504 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:43:18,566 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:43:18,567 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:43:18,698 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:43:18,724 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:43:18,725 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-09 23:43:18,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:43:18 BoogieIcfgContainer [2024-02-09 23:43:18,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:43:18,727 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:43:18,727 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:43:18,730 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:43:18,730 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:43:18,730 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.02 11:43:18" (1/3) ... [2024-02-09 23:43:18,731 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@81a9467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:43:18, skipping insertion in model container [2024-02-09 23:43:18,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:43:18,731 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:43:18" (2/3) ... [2024-02-09 23:43:18,731 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@81a9467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:43:18, skipping insertion in model container [2024-02-09 23:43:18,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:43:18,731 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:43:18" (3/3) ... [2024-02-09 23:43:18,732 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-nonblocking-cntr.wvr.c [2024-02-09 23:43:18,790 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:43:18,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 83 transitions, 180 flow [2024-02-09 23:43:18,842 INFO L124 PetriNetUnfolderBase]: 6/79 cut-off events. [2024-02-09 23:43:18,842 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:43:18,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 6/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-09 23:43:18,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 83 transitions, 180 flow [2024-02-09 23:43:18,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 79 transitions, 170 flow [2024-02-09 23:43:18,856 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:43:18,856 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:43:18,856 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:43:18,856 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:43:18,856 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:43:18,856 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:43:18,857 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:43:18,857 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:43:18,857 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 80 places, 79 transitions, 170 flow [2024-02-09 23:43:18,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:43:18,880 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-02-09 23:43:18,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:43:18,880 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:43:18,885 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:43:18,885 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 80 places, 79 transitions, 170 flow [2024-02-09 23:43:18,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:43:18,894 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-02-09 23:43:18,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-09 23:43:18,894 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:43:18,916 INFO L748 eck$LassoCheckResult]: Stem: 86#[$Ultimate##0]true [167] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 88#[L-1]true [173] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 90#[L21]true [166] 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[] 92#[L21-1]true [185] 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[] 94#[L21-2]true [183] 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[] 96#[L21-3]true [155] L21-3-->L21-4: Formula: (and (= 30 (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[] 98#[L21-4]true [203] L21-4-->L38: Formula: (= v_~M~0_5 0) InVars {} OutVars{~M~0=v_~M~0_5} AuxVars[] AssignedVars[~M~0] 100#[L38]true [204] L38-->L-1-1: Formula: (= v_~counter~0_7 0) InVars {} OutVars{~counter~0=v_~counter~0_7} AuxVars[] AssignedVars[~counter~0] 102#[L-1-1]true [194] 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] 104#[L-1-2]true [197] L-1-2-->L65: 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] 106#[L65]true [207] L65-->L65-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] 108#[L65-1]true [191] L65-1-->L65-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] 110#[L65-2]true [172] L65-2-->L67: 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] 112#[L67]true [188] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~M~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{~M~0=v_~M~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[~M~0] 114#[L67-1]true [162] L67-1-->L68: 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] 116#[L68]true [193] L68-->L68-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~M~0_7) 1 0)) InVars {~M~0=v_~M~0_7} OutVars{~M~0=v_~M~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 118#[L68-1]true [160] L68-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 120#[L34]true [164] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 122#[L35]true [187] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 124#[L34-1]true [181] L34-1-->L68-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 126#[L68-2]true [144] L68-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 128#[L71]true [136] L71-->L71-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] 130#[L71-1]true [159] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 132#[L71-2]true [196] L71-2-->L71-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] 134#[L71-3]true [229] L71-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 136#[$Ultimate##0, L71-4]true [209] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 138#[L41-4, L71-4]true [2024-02-09 23:43:18,917 INFO L750 eck$LassoCheckResult]: Loop: 138#[L41-4, L71-4]true [210] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork0_~i~0_3 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3} AuxVars[] AssignedVars[] 141#[L42, L71-4]true [213] L42-->L44: Formula: (= (+ v_~counter~0_26 1) v_~counter~0_25) InVars {~counter~0=v_~counter~0_26} OutVars{~counter~0=v_~counter~0_25, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post2] 143#[L44, L71-4]true [215] L44-->L41-2: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 145#[L71-4, L41-2]true [217] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 147#[L41-3, L71-4]true [219] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 138#[L41-4, L71-4]true [2024-02-09 23:43:18,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:43:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1788525432, now seen corresponding path program 1 times [2024-02-09 23:43:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:43:18,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694132740] [2024-02-09 23:43:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:43:18,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:43:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:19,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:43:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:19,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:43:19,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:43:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 229127605, now seen corresponding path program 1 times [2024-02-09 23:43:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:43:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123842519] [2024-02-09 23:43:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:43:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:43:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:19,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:43:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:19,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:43:19,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:43:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash -11817586, now seen corresponding path program 1 times [2024-02-09 23:43:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:43:19,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373262160] [2024-02-09 23:43:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:43:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:43:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:19,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:43:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:19,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:43:19,198 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:43:19,198 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:43:19,198 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:43:19,198 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:43:19,199 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-09 23:43:19,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,199 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:43:19,199 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:43:19,199 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr.wvr.c_BEv2_Iteration1_Loop [2024-02-09 23:43:19,199 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:43:19,199 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:43:19,216 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-09 23:43:19,227 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-09 23:43:19,234 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-09 23:43:19,236 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-09 23:43:19,240 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-09 23:43:19,242 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-09 23:43:19,245 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-09 23:43:19,251 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-09 23:43:19,322 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:43:19,323 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-09 23:43:19,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,327 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-09 23:43:19,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:43:19,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,351 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-09 23:43:19,354 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:43:19,354 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-09 23:43:19,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-09 23:43:19,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,364 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-09 23:43:19,365 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-09 23:43:19,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:43:19,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,393 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-09 23:43:19,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,397 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-09 23:43:19,415 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-09 23:43:19,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:43:19,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:43:19,439 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter~0=0} Honda state: {~counter~0=0} Generalized eigenvectors: [{~counter~0=4}, {~counter~0=-3}, {~counter~0=0}] Lambdas: [1, 1, 0] Nus: [0, 1] [2024-02-09 23:43:19,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:43:19,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,447 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-09 23:43:19,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:43:19,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,477 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-09 23:43:19,489 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:43:19,489 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post1=0} Honda state: {thread1Thread1of1ForFork0_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:43:19,492 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-09 23:43:19,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,494 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-09 23:43:19,497 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-09 23:43:19,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:43:19,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,543 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:43:19,543 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:43:19,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-09 23:43:19,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,551 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-09 23:43:19,552 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-09 23:43:19,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:43:19,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,569 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:43:19,570 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_#t~post2=0} Honda state: {thread1Thread1of1ForFork0_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:43:19,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-09 23:43:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,575 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-09 23:43:19,579 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-09 23:43:19,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:43:19,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:43:19,629 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:43:19,636 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-09 23:43:19,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,653 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-09 23:43:19,654 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-09 23:43:19,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:43:19,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-09 23:43:19,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,696 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-09 23:43:19,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:43:19,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:43:19,728 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-09 23:43:19,811 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-09 23:43:19,816 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-09 23:43:19,816 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:43:19,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:43:19,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:43:19,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:43:19,816 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:43:19,816 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:43:19,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:43:19,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr.wvr.c_BEv2_Iteration1_Loop [2024-02-09 23:43:19,817 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:43:19,817 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:43:19,818 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-09 23:43:19,822 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-09 23:43:19,825 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-09 23:43:19,827 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-09 23:43:19,837 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-09 23:43:19,839 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-09 23:43:19,842 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-09 23:43:19,844 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-09 23:43:19,905 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:43:19,908 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:43:19,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,910 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-09 23:43:19,914 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-09 23:43:19,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:19,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:43:19,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:19,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:19,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:19,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:43:19,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:43:19,926 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-09 23:43:19,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:43:19,959 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-09 23:43:19,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:19,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:19,960 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-09 23:43:19,985 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-09 23:43:19,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:19,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:19,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:19,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:19,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:43:19,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:43:19,998 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-09 23:43:20,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:43:20,014 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-09 23:43:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:20,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:20,016 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-09 23:43:20,027 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-09 23:43:20,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:20,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:20,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:20,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:20,035 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-09 23:43:20,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:43:20,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:43:20,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:43:20,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-02-09 23:43:20,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:20,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:20,084 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-09 23:43:20,088 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-09 23:43:20,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:20,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:43:20,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:20,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:20,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:20,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:43:20,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:43:20,099 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-09 23:43:20,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:43:20,112 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-09 23:43:20,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:20,114 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-09 23:43:20,131 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-09 23:43:20,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:20,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:20,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:20,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:20,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:43:20,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:43:20,143 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-09 23:43:20,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:43:20,172 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-09 23:43:20,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:20,173 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-09 23:43:20,179 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-09 23:43:20,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:20,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:43:20,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:20,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:20,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:20,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:43:20,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:43:20,189 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-09 23:43:20,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:43:20,211 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-09 23:43:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:20,215 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-09 23:43:20,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:43:20,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:20,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:20,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:20,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:20,227 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-09 23:43:20,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:43:20,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:43:20,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:43:20,250 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-09 23:43:20,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:20,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:20,251 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-09 23:43:20,255 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-09 23:43:20,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:43:20,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:43:20,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:43:20,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:43:20,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:43:20,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:43:20,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:43:20,266 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-09 23:43:20,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:43:20,276 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-09 23:43:20,276 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-09 23:43:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:43:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:43:20,305 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-09 23:43:20,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:43:20,310 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-09 23:43:20,310 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:43:20,310 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~i~0, ~M~0) = -1*thread1Thread1of1ForFork0_~i~0 + 1*~M~0 Supporting invariants [] [2024-02-09 23:43:20,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-02-09 23:43:20,317 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:43:20,318 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-09 23:43:20,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:43:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:43:20,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:43:20,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:43:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:43:20,441 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:43:20,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:43:20,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-09 23:43:20,527 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-09 23:43:20,559 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-09 23:43:20,563 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:43:20,850 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 1464 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-09 23:43:20,851 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:43:20,851 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:43:20,867 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:43:20,867 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:43:20,869 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-09 23:43:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:43:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 555 transitions. [2024-02-09 23:43:20,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 555 transitions. Stem has 26 letters. Loop has 5 letters. [2024-02-09 23:43:20,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:43:20,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 555 transitions. Stem has 31 letters. Loop has 5 letters. [2024-02-09 23:43:20,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:43:20,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 555 transitions. Stem has 26 letters. Loop has 10 letters. [2024-02-09 23:43:20,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:43:20,883 INFO L428 stractBuchiCegarLoop]: Abstraction has has 106 places, 2776 transitions, 11506 flow [2024-02-09 23:43:20,883 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:43:20,883 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 places, 2776 transitions, 11506 flow [2024-02-09 23:43:21,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:43:21,027 INFO L124 PetriNetUnfolderBase]: 359/662 cut-off events. [2024-02-09 23:43:21,027 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-09 23:43:21,027 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:43:21,029 INFO L748 eck$LassoCheckResult]: Stem: 86#[$Ultimate##0]true [167] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 88#[L-1]true [173] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 90#[L21]true [166] 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[] 92#[L21-1]true [185] 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[] 94#[L21-2]true [183] 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[] 96#[L21-3]true [155] L21-3-->L21-4: Formula: (and (= 30 (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[] 98#[L21-4]true [203] L21-4-->L38: Formula: (= v_~M~0_5 0) InVars {} OutVars{~M~0=v_~M~0_5} AuxVars[] AssignedVars[~M~0] 100#[L38]true [204] L38-->L-1-1: Formula: (= v_~counter~0_7 0) InVars {} OutVars{~counter~0=v_~counter~0_7} AuxVars[] AssignedVars[~counter~0] 102#[L-1-1]true [194] 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] 104#[L-1-2]true [197] L-1-2-->L65: 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] 106#[L65]true [207] L65-->L65-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] 108#[L65-1]true [191] L65-1-->L65-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] 110#[L65-2]true [172] L65-2-->L67: 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] 112#[L67]true [188] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~M~0_6) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{~M~0=v_~M~0_6, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[~M~0] 114#[L67-1]true [162] L67-1-->L68: 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] 116#[L68]true [193] L68-->L68-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~M~0_7) 1 0)) InVars {~M~0=v_~M~0_7} OutVars{~M~0=v_~M~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 118#[L68-1]true [160] L68-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 120#[L34]true [164] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 122#[L35]true [187] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 124#[L34-1]true [181] L34-1-->L68-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 126#[L68-2]true [144] L68-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 128#[L71]true [136] L71-->L71-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] 130#[L71-1]true [159] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 132#[L71-2]true [196] L71-2-->L71-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] 134#[L71-3]true [229] L71-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 136#[$Ultimate##0, L71-4]true [149] L71-4-->L71-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] 349#[L71-5, $Ultimate##0]true [178] L71-5-->L72: 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] 351#[$Ultimate##0, L72]true [205] L72-->L72-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] 353#[L72-1, $Ultimate##0]true [130] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 355#[$Ultimate##0, L72-2]true [140] L72-2-->L72-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] 357#[L72-3, $Ultimate##0]true [232] L72-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre8#1_7| v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_12, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_6|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_7|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 359#[L72-4, $Ultimate##0, $Ultimate##0]true [220] $Ultimate##0-->L54-1: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 361#[L72-4, $Ultimate##0, L54-1]true [221] L54-1-->L53: Formula: (< v_thread2Thread1of1ForFork1_~i~1_3 v_~M~0_4) InVars {~M~0=v_~M~0_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3} OutVars{~M~0=v_~M~0_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3} AuxVars[] AssignedVars[] 363#[L72-4, $Ultimate##0, L53]true [224] L53-->L54-1: Formula: (or (and (= v_~counter~0_Out_2 v_~counter~0_In_1) (= v_thread2Thread1of1ForFork1_~i~1_8 v_thread2Thread1of1ForFork1_~i~1_7) (= |v_thread2Thread1of1ForFork1_#t~post3_1| |v_thread2Thread1of1ForFork1_#t~post3_2|) (= |v_thread2Thread1of1ForFork1_#t~post4_2| |v_thread2Thread1of1ForFork1_#t~post4_1|) (<= v_~counter~0_In_1 0)) (and (< 0 v_~counter~0_In_1) (= v_~counter~0_In_1 (+ v_~counter~0_Out_2 1)) (= (+ v_thread2Thread1of1ForFork1_~i~1_7 1) v_thread2Thread1of1ForFork1_~i~1_8))) InVars {~counter~0=v_~counter~0_In_1, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|} OutVars{~counter~0=v_~counter~0_Out_2, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_2|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_8, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_2|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] 361#[L72-4, $Ultimate##0, L54-1]true [2024-02-09 23:43:21,029 INFO L750 eck$LassoCheckResult]: Loop: 361#[L72-4, $Ultimate##0, L54-1]true [221] L54-1-->L53: Formula: (< v_thread2Thread1of1ForFork1_~i~1_3 v_~M~0_4) InVars {~M~0=v_~M~0_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3} OutVars{~M~0=v_~M~0_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3} AuxVars[] AssignedVars[] 363#[L72-4, $Ultimate##0, L53]true [224] L53-->L54-1: Formula: (or (and (= v_~counter~0_Out_2 v_~counter~0_In_1) (= v_thread2Thread1of1ForFork1_~i~1_8 v_thread2Thread1of1ForFork1_~i~1_7) (= |v_thread2Thread1of1ForFork1_#t~post3_1| |v_thread2Thread1of1ForFork1_#t~post3_2|) (= |v_thread2Thread1of1ForFork1_#t~post4_2| |v_thread2Thread1of1ForFork1_#t~post4_1|) (<= v_~counter~0_In_1 0)) (and (< 0 v_~counter~0_In_1) (= v_~counter~0_In_1 (+ v_~counter~0_Out_2 1)) (= (+ v_thread2Thread1of1ForFork1_~i~1_7 1) v_thread2Thread1of1ForFork1_~i~1_8))) InVars {~counter~0=v_~counter~0_In_1, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|} OutVars{~counter~0=v_~counter~0_Out_2, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_2|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_8, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_2|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] 361#[L72-4, $Ultimate##0, L54-1]true [2024-02-09 23:43:21,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:43:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash 253265224, now seen corresponding path program 1 times [2024-02-09 23:43:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:43:21,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153408522] [2024-02-09 23:43:21,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:43:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:43:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:43:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:43:21,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:43:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 8036, now seen corresponding path program 1 times [2024-02-09 23:43:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:43:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800988329] [2024-02-09 23:43:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:43:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:43:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:43:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:43:21,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:43:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1425248533, now seen corresponding path program 2 times [2024-02-09 23:43:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:43:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787902016] [2024-02-09 23:43:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:43:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:43:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:43:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:43:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:43:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:43:21,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:43:21 BoogieIcfgContainer [2024-02-09 23:43:21,906 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:43:21,906 INFO L158 Benchmark]: Toolchain (without parser) took 3717.95ms. Allocated memory was 183.5MB in the beginning and 256.9MB in the end (delta: 73.4MB). Free memory was 115.6MB in the beginning and 201.0MB in the end (delta: -85.4MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:43:21,906 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:43:21,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.63ms. Allocated memory was 183.5MB in the beginning and 256.9MB in the end (delta: 73.4MB). Free memory was 115.4MB in the beginning and 225.2MB in the end (delta: -109.8MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2024-02-09 23:43:21,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.86ms. Allocated memory is still 256.9MB. Free memory was 225.2MB in the beginning and 223.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:43:21,908 INFO L158 Benchmark]: Boogie Preprocessor took 16.98ms. Allocated memory is still 256.9MB. Free memory was 223.6MB in the beginning and 222.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:43:21,908 INFO L158 Benchmark]: RCFGBuilder took 285.68ms. Allocated memory is still 256.9MB. Free memory was 222.1MB in the beginning and 207.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-02-09 23:43:21,908 INFO L158 Benchmark]: BuchiAutomizer took 3178.60ms. Allocated memory is still 256.9MB. Free memory was 207.4MB in the beginning and 201.0MB in the end (delta: 6.4MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2024-02-09 23:43:21,910 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.12ms. Allocated memory is still 183.5MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.63ms. Allocated memory was 183.5MB in the beginning and 256.9MB in the end (delta: 73.4MB). Free memory was 115.4MB in the beginning and 225.2MB in the end (delta: -109.8MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.86ms. Allocated memory is still 256.9MB. Free memory was 225.2MB in the beginning and 223.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.98ms. Allocated memory is still 256.9MB. Free memory was 223.6MB in the beginning and 222.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 285.68ms. Allocated memory is still 256.9MB. Free memory was 222.1MB in the beginning and 207.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 3178.60ms. Allocated memory is still 256.9MB. Free memory was 207.4MB in the beginning and 201.0MB in the end (delta: 6.4MB). Peak memory consumption was 6.4MB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((-1 * i) + M) and consists of 7 locations. The remainder module has 11506 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 759 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 269 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax288 hnf100 lsp24 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 52]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 int M, counter; VAL [M=0, counter=0] [L65] 0 pthread_t t1, t2; VAL [M=0, counter=0, t1={12524:0}, t2={12523:0}] [L67] 0 M = __VERIFIER_nondet_int() VAL [M=1, __VERIFIER_nondet_int()=1, counter=0, t1={12524:0}, t2={12523:0}] [L68] CALL 0 assume_abort_if_not(M > 0) [L35] COND FALSE 0 !(!cond) VAL [M=1, \old(cond)=1, cond=1, counter=0] [L68] RET 0 assume_abort_if_not(M > 0) [L71] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [M=1, counter=0, pthread_create(&t1, 0, thread1, 0)=31220, t1={12524:0}, t2={12523:0}] [L72] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [M=1, counter=0, pthread_create(&t2, 0, thread2, 0)=31221, t1={12524:0}, t2={12523:0}] [L51] 2 int i = 0; VAL [M=1, counter=0, i=0] [L52] COND TRUE 2 i < M VAL [M=1, counter=0, i=0] [L54] COND FALSE 2 !(counter > 0) VAL [M=1, counter--=20, counter=0, i++=22, i=0] Loop: [L52] COND TRUE i < M [L54] COND TRUE counter > 0 [L55] counter-- [L56] i++ End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 52]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 int M, counter; VAL [M=0, counter=0] [L65] 0 pthread_t t1, t2; VAL [M=0, counter=0, t1={12524:0}, t2={12523:0}] [L67] 0 M = __VERIFIER_nondet_int() VAL [M=1, __VERIFIER_nondet_int()=1, counter=0, t1={12524:0}, t2={12523:0}] [L68] CALL 0 assume_abort_if_not(M > 0) [L35] COND FALSE 0 !(!cond) VAL [M=1, \old(cond)=1, cond=1, counter=0] [L68] RET 0 assume_abort_if_not(M > 0) [L71] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [M=1, counter=0, pthread_create(&t1, 0, thread1, 0)=31220, t1={12524:0}, t2={12523:0}] [L72] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [M=1, counter=0, pthread_create(&t2, 0, thread2, 0)=31221, t1={12524:0}, t2={12523:0}] [L51] 2 int i = 0; VAL [M=1, counter=0, i=0] [L52] COND TRUE 2 i < M VAL [M=1, counter=0, i=0] [L54] COND FALSE 2 !(counter > 0) VAL [M=1, counter--=20, counter=0, i++=22, i=0] Loop: [L52] COND TRUE i < M [L54] COND TRUE counter > 0 [L55] counter-- [L56] i++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:43:21,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...