/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:24:50,923 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:24:50,960 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 11:24:50,976 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:24:50,976 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:24:50,977 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:24:50,977 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:24:50,978 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:24:50,978 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:24:50,978 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:24:50,978 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:24:50,979 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:24:50,979 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:24:50,979 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:24:50,979 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:24:50,980 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:24:50,980 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:24:50,980 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:24:50,980 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:24:50,981 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:24:50,981 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:24:50,981 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:24:50,982 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:24:50,982 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:24:50,982 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:24:50,982 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:24:50,982 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:24:50,983 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:24:50,983 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:24:50,983 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:24:50,983 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:24:50,984 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:24:50,984 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:24:50,984 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:24:50,985 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:24:50,985 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> NONE [2023-09-17 11:24:51,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:24:51,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:24:51,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:24:51,197 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:24:51,198 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:24:51,202 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 [2023-09-17 11:24:52,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:24:52,369 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:24:52,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c [2023-09-17 11:24:52,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bfa5ac2/edd62d04acea4512932049081f09f819/FLAG39029322f [2023-09-17 11:24:52,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bfa5ac2/edd62d04acea4512932049081f09f819 [2023-09-17 11:24:52,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:24:52,397 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:24:52,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:24:52,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:24:52,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:24:52,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd5d0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52, skipping insertion in model container [2023-09-17 11:24:52,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:24:52,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:24:52,568 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c[1991,2004] [2023-09-17 11:24:52,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:24:52,577 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:24:52,596 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr.wvr.c[1991,2004] [2023-09-17 11:24:52,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:24:52,605 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:24:52,605 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:24:52,610 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:24:52,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52 WrapperNode [2023-09-17 11:24:52,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:24:52,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:24:52,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:24:52,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:24:52,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,644 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2023-09-17 11:24:52,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:24:52,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:24:52,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:24:52,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:24:52,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:24:52,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:24:52,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:24:52,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:24:52,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (1/1) ... [2023-09-17 11:24:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:24:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:24:52,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:24:52,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-09-17 11:24:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:24:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:24:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:24:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:24:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:24:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:24:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:24:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:24:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:24:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:24:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:24:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:24:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:24:52,743 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 11:24:52,808 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:24:52,812 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:24:52,971 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:24:53,011 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:24:53,011 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-17 11:24:53,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:24:53 BoogieIcfgContainer [2023-09-17 11:24:53,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:24:53,013 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:24:53,013 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:24:53,016 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:24:53,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:24:53,016 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:24:52" (1/3) ... [2023-09-17 11:24:53,017 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@717dd929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:24:53, skipping insertion in model container [2023-09-17 11:24:53,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:24:53,017 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:24:52" (2/3) ... [2023-09-17 11:24:53,017 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@717dd929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:24:53, skipping insertion in model container [2023-09-17 11:24:53,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:24:53,017 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:24:53" (3/3) ... [2023-09-17 11:24:53,018 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-nonblocking-cntr.wvr.c [2023-09-17 11:24:53,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:24:53,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 69 transitions, 148 flow [2023-09-17 11:24:53,136 INFO L124 PetriNetUnfolderBase]: 6/65 cut-off events. [2023-09-17 11:24:53,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:24:53,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 65 events. 6/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2023-09-17 11:24:53,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 69 transitions, 148 flow [2023-09-17 11:24:53,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 65 transitions, 136 flow [2023-09-17 11:24:53,151 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:24:53,151 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:24:53,151 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:24:53,151 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:24:53,151 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:24:53,151 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:24:53,152 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:24:53,152 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:24:53,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-17 11:24:53,281 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 638 [2023-09-17 11:24:53,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:24:53,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:24:53,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:24:53,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-09-17 11:24:53,285 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:24:53,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 942 states, but on-demand construction may add more states [2023-09-17 11:24:53,301 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 638 [2023-09-17 11:24:53,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:24:53,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:24:53,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:24:53,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-09-17 11:24:53,306 INFO L748 eck$LassoCheckResult]: Stem: 71#[$Ultimate##0]don't care [148] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 74#[L-1]don't care [152] L-1-->L-1-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[] 76#[L-1-1]don't care [167] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 78#[L21]don't care [147] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_8| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 80#[L21-1]don't care [160] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 82#[L21-2]don't care [159] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 84#[L21-3]don't care [137] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_4| 2))) InVars {#length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[] 86#[L21-4]don't care [175] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 88#[L38]don't care [176] L38-->L-1-2: Formula: (= v_~counter~0_8 0) InVars {} OutVars{~counter~0=v_~counter~0_8} AuxVars[] AssignedVars[~counter~0] 90#[L-1-2]don't care [169] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 92#[L-1-3]don't care [172] L-1-3-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} 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~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 94#[L65]don't care [178] L65-->L65-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_10|) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_5|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 96#[L65-1]don't care [164] L65-1-->L65-2: Formula: (and (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_12|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_7|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 98#[L65-2]don't care [151] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 100#[L67]don't care [163] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~M~0_7) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~M~0=v_~M~0_7, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~M~0] 102#[L67-1]don't care [143] L67-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 104#[L68]don't care [166] L68-->L68-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~M~0_5) 1 0)) InVars {~M~0=v_~M~0_5} OutVars{~M~0=v_~M~0_5, 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] 106#[L68-1]don't care [141] 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] 108#[L34]don't care [145] 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] 110#[L35]don't care [162] 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[] 114#[L34-1]don't care [157] L34-1-->L71: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 116#[L71]don't care [120] L71-->L71-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 118#[L71-1]don't care [140] L71-1-->L71-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre6#1_2|)) |v_#memory_int_1|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_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|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_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|} AuxVars[] AssignedVars[#memory_int] 120#[L71-2]don't care [202] L71-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 122#[$Ultimate##0, L71-3]don't care [180] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 124#[L71-3, L41-4]don't care [2023-09-17 11:24:53,307 INFO L750 eck$LassoCheckResult]: Loop: 124#[L71-3, L41-4]don't care [181] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3} AuxVars[] AssignedVars[] 130#[L42, L71-3]don't care [184] 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, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post2] 142#[L71-3, L44]don't care [186] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 158#[L41-2, L71-3]don't care [188] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 178#[L71-3, L41-3]don't care [189] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 124#[L71-3, L41-4]don't care [2023-09-17 11:24:53,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:24:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1307893969, now seen corresponding path program 1 times [2023-09-17 11:24:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:24:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186622671] [2023-09-17 11:24:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:24:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:24:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:53,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:24:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:53,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:24:53,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:24:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 201452759, now seen corresponding path program 1 times [2023-09-17 11:24:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:24:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014137642] [2023-09-17 11:24:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:24:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:24:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:53,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:24:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:53,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:24:53,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:24:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 496048745, now seen corresponding path program 1 times [2023-09-17 11:24:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:24:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535038565] [2023-09-17 11:24:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:24:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:24:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:53,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:24:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:53,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:24:53,563 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:24:53,563 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:24:53,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:24:53,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:24:53,564 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-09-17 11:24:53,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:24:53,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:24:53,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:24:53,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr.wvr.c_BEv2_Iteration1_Loop [2023-09-17 11:24:53,564 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:24:53,564 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:24:53,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,651 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:24:53,652 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-09-17 11:24:53,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:24:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:24:53,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:24:53,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-09-17 11:24:53,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 11:24:53,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:24:53,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-09-17 11:24:53,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:24:53,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:24:53,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:24:53,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-09-17 11:24:53,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-09-17 11:24:53,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 11:24:53,796 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-09-17 11:24:53,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-09-17 11:24:53,801 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 11:24:53,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 11:24:53,801 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 11:24:53,801 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 11:24:53,801 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 11:24:53,801 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:24:53,801 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 11:24:53,801 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 11:24:53,801 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr.wvr.c_BEv2_Iteration1_Loop [2023-09-17 11:24:53,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 11:24:53,801 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 11:24:53,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 11:24:53,874 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 11:24:53,877 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 11:24:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:24:53,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:24:53,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:24:53,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-09-17 11:24:53,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-09-17 11:24:53,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 11:24:53,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 11:24:53,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 11:24:53,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 11:24:53,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 11:24:53,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 11:24:53,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 11:24:53,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 11:24:53,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-09-17 11:24:53,950 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-09-17 11:24:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:24:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:24:53,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 11:24:54,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-09-17 11:24:54,003 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 11:24:54,003 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-09-17 11:24:54,003 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 11:24:54,004 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M~0, thread1Thread1of1ForFork1_~i~0) = 1*~M~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2023-09-17 11:24:54,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-09-17 11:24:54,028 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-09-17 11:24:54,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:24:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:24:54,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-17 11:24:54,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:24:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:24:54,135 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 11:24:54,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 11:24:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:24:54,235 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 [2023-09-17 11:24:54,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 942 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:24:54,352 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 942 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 2203 states and 7211 transitions. Complement of second has 9 states. [2023-09-17 11:24:54,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 11:24:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:24:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2023-09-17 11:24:54,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 193 transitions. Stem has 25 letters. Loop has 5 letters. [2023-09-17 11:24:54,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:24:54,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 193 transitions. Stem has 30 letters. Loop has 5 letters. [2023-09-17 11:24:54,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:24:54,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 193 transitions. Stem has 25 letters. Loop has 10 letters. [2023-09-17 11:24:54,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 11:24:54,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2203 states and 7211 transitions. [2023-09-17 11:24:54,383 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 144 [2023-09-17 11:24:54,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2203 states to 619 states and 1825 transitions. [2023-09-17 11:24:54,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2023-09-17 11:24:54,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 440 [2023-09-17 11:24:54,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 619 states and 1825 transitions. [2023-09-17 11:24:54,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 11:24:54,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 619 states and 1825 transitions. [2023-09-17 11:24:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states and 1825 transitions. [2023-09-17 11:24:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 502. [2023-09-17 11:24:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 502 states have (on average 2.944223107569721) internal successors, (1478), 501 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 11:24:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1478 transitions. [2023-09-17 11:24:54,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 502 states and 1478 transitions. [2023-09-17 11:24:54,445 INFO L428 stractBuchiCegarLoop]: Abstraction has 502 states and 1478 transitions. [2023-09-17 11:24:54,445 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:24:54,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 502 states and 1478 transitions. [2023-09-17 11:24:54,448 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 144 [2023-09-17 11:24:54,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:24:54,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:24:54,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:24:54,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-17 11:24:54,450 INFO L748 eck$LassoCheckResult]: Stem: 5204#[$Ultimate##0]don't care [148] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 5206#[L-1]don't care [152] L-1-->L-1-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[] 5224#[L-1-1]don't care [167] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 5022#[L21]don't care [147] L21-->L21-1: Formula: (and (= 2 (select |v_#length_3| 1)) (= (select |v_#valid_8| 1) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[] 5024#[L21-1]don't care [160] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 5230#[L21-2]don't care [159] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 5232#[L21-3]don't care [137] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 30 (select |v_#length_4| 2))) InVars {#length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[] 4816#[L21-4]don't care [175] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 4818#[L38]don't care [176] L38-->L-1-2: Formula: (= v_~counter~0_8 0) InVars {} OutVars{~counter~0=v_~counter~0_8} AuxVars[] AssignedVars[~counter~0] 5244#[L-1-2]don't care [169] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 5278#[L-1-3]don't care [172] L-1-3-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} 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~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 5280#[L65]don't care [178] L65-->L65-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_10|) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_5|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 4788#[L65-1]don't care [164] L65-1-->L65-2: Formula: (and (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_12|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_7|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 4790#[L65-2]don't care [151] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 5222#[L67]don't care [163] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_4| v_~M~0_7) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} OutVars{~M~0=v_~M~0_7, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[~M~0] 4990#[L67-1]don't care [143] L67-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 4992#[L68]don't care [166] L68-->L68-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~M~0_5) 1 0)) InVars {~M~0=v_~M~0_5} OutVars{~M~0=v_~M~0_5, 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] 4986#[L68-1]don't care [141] 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] 4988#[L34]don't care [145] 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] 5200#[L35]don't care [162] 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[] 5264#[L34-1]don't care [157] L34-1-->L71: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 4862#[L71]don't care [120] L71-->L71-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 4864#[L71-1]don't care [140] L71-1-->L71-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre6#1_2|)) |v_#memory_int_1|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_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|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_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|} AuxVars[] AssignedVars[#memory_int] 5138#[L71-2]don't care [202] L71-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 5140#[$Ultimate##0, L71-3]don't care [149] L71-3-->L71-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 5108#[L71-4, $Ultimate##0]don't care [132] L71-4-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 5110#[$Ultimate##0, L72]don't care [177] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_1| |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_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] 5212#[$Ultimate##0, L72-1]don't care [115] 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] 5132#[$Ultimate##0, L72-2]don't care [124] L72-2-->L72-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre8#1_2|)) |v_#memory_int_3|) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 4468#[L72-3, $Ultimate##0]don't care [199] L72-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_12, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_6|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_6|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 4472#[$Ultimate##0, L72-4, $Ultimate##0]don't care [190] $Ultimate##0-->L54-1: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1] 5028#[L72-4, $Ultimate##0, L54-1]don't care [2023-09-17 11:24:54,450 INFO L750 eck$LassoCheckResult]: Loop: 5028#[L72-4, $Ultimate##0, L54-1]don't care [191] L54-1-->L53: Formula: (< v_thread2Thread1of1ForFork0_~i~1_3 v_~M~0_4) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_3, ~M~0=v_~M~0_4} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_3, ~M~0=v_~M~0_4} AuxVars[] AssignedVars[] 5076#[L53, L72-4, $Ultimate##0]don't care [194] L53-->L54-1: Formula: (or (and (< 0 v_~counter~0_In_1) (= (+ v_thread2Thread1of1ForFork0_~i~1_7 1) v_thread2Thread1of1ForFork0_~i~1_8) (= v_~counter~0_In_1 (+ v_~counter~0_Out_2 1))) (and (= v_thread2Thread1of1ForFork0_~i~1_8 v_thread2Thread1of1ForFork0_~i~1_7) (= v_~counter~0_Out_2 v_~counter~0_In_1) (= |v_thread2Thread1of1ForFork0_#t~post4_2| |v_thread2Thread1of1ForFork0_#t~post4_1|) (= |v_thread2Thread1of1ForFork0_#t~post3_2| |v_thread2Thread1of1ForFork0_#t~post3_1|) (<= v_~counter~0_In_1 0))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_7, ~counter~0=v_~counter~0_In_1, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_1|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_8, ~counter~0=v_~counter~0_Out_2, thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_2|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, ~counter~0, thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4] 5028#[L72-4, $Ultimate##0, L54-1]don't care [2023-09-17 11:24:54,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:24:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -661670339, now seen corresponding path program 1 times [2023-09-17 11:24:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:24:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034982139] [2023-09-17 11:24:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:24:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:24:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:54,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:24:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:54,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:24:54,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:24:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 7076, now seen corresponding path program 1 times [2023-09-17 11:24:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:24:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891338361] [2023-09-17 11:24:54,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:24:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:24:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:54,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:24:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:54,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:24:54,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:24:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash -210029856, now seen corresponding path program 1 times [2023-09-17 11:24:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:24:54,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792961436] [2023-09-17 11:24:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:24:54,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:24:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:54,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:24:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:54,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:24:54,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-09-17 11:24:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:55,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:24:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:24:55,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:24:55 BoogieIcfgContainer [2023-09-17 11:24:55,365 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:24:55,366 INFO L158 Benchmark]: Toolchain (without parser) took 2969.15ms. Allocated memory is still 297.8MB. Free memory was 250.3MB in the beginning and 210.1MB in the end (delta: 40.2MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2023-09-17 11:24:55,366 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:24:55,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.70ms. Allocated memory is still 297.8MB. Free memory was 249.7MB in the beginning and 239.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-09-17 11:24:55,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.76ms. Allocated memory is still 297.8MB. Free memory was 239.2MB in the beginning and 237.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:24:55,367 INFO L158 Benchmark]: Boogie Preprocessor took 24.39ms. Allocated memory is still 297.8MB. Free memory was 237.7MB in the beginning and 236.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:24:55,367 INFO L158 Benchmark]: RCFGBuilder took 342.07ms. Allocated memory is still 297.8MB. Free memory was 236.5MB in the beginning and 222.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-09-17 11:24:55,368 INFO L158 Benchmark]: BuchiAutomizer took 2352.02ms. Allocated memory is still 297.8MB. Free memory was 222.4MB in the beginning and 210.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2023-09-17 11:24:55,369 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.13ms. Allocated memory is still 176.2MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.70ms. Allocated memory is still 297.8MB. Free memory was 249.7MB in the beginning and 239.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.76ms. Allocated memory is still 297.8MB. Free memory was 239.2MB in the beginning and 237.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.39ms. Allocated memory is still 297.8MB. Free memory was 237.7MB in the beginning and 236.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 342.07ms. Allocated memory is still 297.8MB. Free memory was 236.5MB in the beginning and 222.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 2352.02ms. Allocated memory is still 297.8MB. Free memory was 222.4MB in the beginning and 210.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 6 locations. The remainder module has 502 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 117 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 90 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax313 hnf100 lsp21 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 125ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 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={14586:0}, t2={14585:0}] [L67] 0 M = __VERIFIER_nondet_int() VAL [M=1, __VERIFIER_nondet_int()=1, counter=0, t1={14586:0}, t2={14585: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)=15684, t1={14586:0}, t2={14585:0}] [L72] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [M=1, counter=0, pthread_create(&t2, 0, thread2, 0)=15685, t1={14586:0}, t2={14585:0}] [L51] 2 int i = 0; VAL [M=1, counter=0, 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={14586:0}, t2={14585:0}] [L67] 0 M = __VERIFIER_nondet_int() VAL [M=1, __VERIFIER_nondet_int()=1, counter=0, t1={14586:0}, t2={14585: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)=15684, t1={14586:0}, t2={14585:0}] [L72] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [M=1, counter=0, pthread_create(&t2, 0, thread2, 0)=15685, t1={14586:0}, t2={14585:0}] [L51] 2 int i = 0; VAL [M=1, counter=0, 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! [2023-09-17 11:24:55,431 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...