/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 FAIRNESS_LAZY -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.3-wip.me.fairness-42053ae-m
[2023-09-17 12:00:25,068 INFO L172 SettingsManager]: Resetting all preferences to default values...
[2023-09-17 12:00:25,158 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 12:00:25,186 INFO L114 SettingsManager]: Preferences different from defaults after loading the file:
[2023-09-17 12:00:25,187 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-09-17 12:00:25,187 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-09-17 12:00:25,189 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-09-17 12:00:25,189 INFO L137 SettingsManager]: * Create parallel compositions if possible=false
[2023-09-17 12:00:25,189 INFO L137 SettingsManager]: * Use SBE=true
[2023-09-17 12:00:25,193 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2023-09-17 12:00:25,193 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2023-09-17 12:00:25,193 INFO L137 SettingsManager]: * Use old map elimination=false
[2023-09-17 12:00:25,193 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false
[2023-09-17 12:00:25,194 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true
[2023-09-17 12:00:25,195 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2023-09-17 12:00:25,195 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-09-17 12:00:25,195 INFO L137 SettingsManager]: * sizeof long=4
[2023-09-17 12:00:25,195 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2023-09-17 12:00:25,195 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true
[2023-09-17 12:00:25,196 INFO L137 SettingsManager]: * sizeof POINTER=4
[2023-09-17 12:00:25,196 INFO L137 SettingsManager]: * Check division by zero=IGNORE
[2023-09-17 12:00:25,196 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2023-09-17 12:00:25,196 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2023-09-17 12:00:25,197 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2023-09-17 12:00:25,198 INFO L137 SettingsManager]: * sizeof long double=12
[2023-09-17 12:00:25,198 INFO L137 SettingsManager]: * Check if freed pointer was valid=false
[2023-09-17 12:00:25,198 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false
[2023-09-17 12:00:25,198 INFO L137 SettingsManager]: * Use constant arrays=true
[2023-09-17 12:00:25,198 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2023-09-17 12:00:25,198 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-09-17 12:00:25,199 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-09-17 12:00:25,199 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-09-17 12:00:25,199 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-09-17 12:00:25,199 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-09-17 12:00:25,201 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2023-09-17 12:00:25,201 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 -> FAIRNESS_LAZY
[2023-09-17 12:00:25,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-09-17 12:00:25,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-09-17 12:00:25,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-09-17 12:00:25,443 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-09-17 12:00:25,443 INFO L274 PluginConnector]: CDTParser initialized
[2023-09-17 12:00:25,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c
[2023-09-17 12:00:26,574 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-09-17 12:00:26,702 INFO L384 CDTParser]: Found 1 translation units.
[2023-09-17 12:00:26,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c
[2023-09-17 12:00:26,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755ddc272/1e420edf5d6f496faf1b4c75c6a7977c/FLAGe5bd2d6e9
[2023-09-17 12:00:26,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755ddc272/1e420edf5d6f496faf1b4c75c6a7977c
[2023-09-17 12:00:26,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-09-17 12:00:26,729 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2023-09-17 12:00:26,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-09-17 12:00:26,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-09-17 12:00:26,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-09-17 12:00:26,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2b4b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26, skipping insertion in model container
[2023-09-17 12:00:26,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2023-09-17 12:00:26,752 INFO L178 MainTranslator]: Built tables and reachable declarations
[2023-09-17 12:00:26,862 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/parallel-misc-2-unrolled-atomic.wvr.c[2206,2219]
[2023-09-17 12:00:26,863 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-09-17 12:00:26,870 INFO L203 MainTranslator]: Completed pre-run
[2023-09-17 12:00:26,881 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/parallel-misc-2-unrolled-atomic.wvr.c[2206,2219]
[2023-09-17 12:00:26,882 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-09-17 12:00:26,886 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-09-17 12:00:26,886 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-09-17 12:00:26,891 INFO L208 MainTranslator]: Completed translation
[2023-09-17 12:00:26,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26 WrapperNode
[2023-09-17 12:00:26,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-09-17 12:00:26,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-09-17 12:00:26,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-09-17 12:00:26,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-09-17 12:00:26,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,927 INFO L138 Inliner]: procedures = 20, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62
[2023-09-17 12:00:26,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-09-17 12:00:26,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-09-17 12:00:26,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-09-17 12:00:26,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-09-17 12:00:26,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-09-17 12:00:26,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-09-17 12:00:26,954 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-09-17 12:00:26,954 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-09-17 12:00:26,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (1/1) ...
[2023-09-17 12:00:26,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:26,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-17 12:00:26,990 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 12:00:27,004 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 12:00:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-09-17 12:00:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2023-09-17 12:00:27,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2023-09-17 12:00:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2023-09-17 12:00:27,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2023-09-17 12:00:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-09-17 12:00:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-09-17 12:00:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-09-17 12:00:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-09-17 12:00:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-09-17 12:00:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-09-17 12:00:27,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-09-17 12:00:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-09-17 12:00:27,030 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 12:00:27,106 INFO L236 CfgBuilder]: Building ICFG
[2023-09-17 12:00:27,108 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-09-17 12:00:27,259 INFO L277 CfgBuilder]: Performing block encoding
[2023-09-17 12:00:27,306 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-09-17 12:00:27,306 INFO L302 CfgBuilder]: Removed 2 assume(true) statements.
[2023-09-17 12:00:27,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:00:27 BoogieIcfgContainer
[2023-09-17 12:00:27,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-09-17 12:00:27,309 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2023-09-17 12:00:27,309 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2023-09-17 12:00:27,312 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2023-09-17 12:00:27,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-09-17 12:00:27,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 12:00:26" (1/3) ...
[2023-09-17 12:00:27,313 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@390a6561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:00:27, skipping insertion in model container
[2023-09-17 12:00:27,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-09-17 12:00:27,313 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:00:26" (2/3) ...
[2023-09-17 12:00:27,313 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@390a6561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:00:27, skipping insertion in model container
[2023-09-17 12:00:27,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-09-17 12:00:27,314 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:00:27" (3/3) ...
[2023-09-17 12:00:27,314 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-misc-2-unrolled-atomic.wvr.c
[2023-09-17 12:00:27,361 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-09-17 12:00:27,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 81 transitions, 172 flow
[2023-09-17 12:00:27,402 INFO L124 PetriNetUnfolderBase]: 7/77 cut-off events.
[2023-09-17 12:00:27,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-09-17 12:00:27,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 7/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place.
[2023-09-17 12:00:27,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 81 transitions, 172 flow
[2023-09-17 12:00:27,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 77 transitions, 160 flow
[2023-09-17 12:00:27,419 INFO L303 stractBuchiCegarLoop]: Interprodecural is true
[2023-09-17 12:00:27,419 INFO L304 stractBuchiCegarLoop]: Hoare is false
[2023-09-17 12:00:27,419 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2023-09-17 12:00:27,419 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2023-09-17 12:00:27,419 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2023-09-17 12:00:27,419 INFO L308 stractBuchiCegarLoop]: Difference is false
[2023-09-17 12:00:27,420 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2023-09-17 12:00:27,420 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2023-09-17 12:00:27,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null
[2023-09-17 12:00:28,091 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16
[2023-09-17 12:00:28,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-09-17 12:00:28,092 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-09-17 12:00:28,099 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, 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 12:00:28,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2023-09-17 12:00:28,100 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2023-09-17 12:00:28,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null
[2023-09-17 12:00:28,318 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16
[2023-09-17 12:00:28,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-09-17 12:00:28,319 INFO L119 BuchiIsEmpty]: Starting construction of run
[2023-09-17 12:00:28,322 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, 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 12:00:28,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2023-09-17 12:00:28,337 INFO L748 eck$LassoCheckResult]: Stem: SleepPredicate [underlying: 82#[$Ultimate##0]don't care, sleep set: []] [169] $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] SleepPredicate [underlying: 85#[L-1]don't care, sleep set: []] [175] L-1-->L-1-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 87#[L-1-1]don't care, sleep set: []] [199] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 89#[L21]don't care, sleep set: []] [168] 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[] SleepPredicate [underlying: 91#[L21-1]don't care, sleep set: []] [188] 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[] SleepPredicate [underlying: 93#[L21-2]don't care, sleep set: []] [185] 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[] SleepPredicate [underlying: 95#[L21-3]don't care, sleep set: []] [156] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 97#[L21-4]don't care, sleep set: []] [214] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] SleepPredicate [underlying: 99#[L37]don't care, sleep set: []] [197] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] SleepPredicate [underlying: 101#[L37-1]don't care, sleep set: []] [198] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] SleepPredicate [underlying: 103#[L37-2]don't care, sleep set: []] [157] L37-2-->L-1-2: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] SleepPredicate [underlying: 105#[L-1-2]don't care, sleep set: []] [202] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 107#[L-1-3]don't care, sleep set: []] [212] L-1-3-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet14#1] SleepPredicate [underlying: 109#[L66]don't care, sleep set: []] [173] L66-->L66-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] SleepPredicate [underlying: 111#[L66-1]don't care, sleep set: []] [203] L66-1-->L66-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] SleepPredicate [underlying: 113#[L66-2]don't care, sleep set: []] [179] L66-2-->L69: 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] SleepPredicate [underlying: 115#[L69]don't care, sleep set: []] [151] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0] SleepPredicate [underlying: 117#[L69-1]don't care, sleep set: []] [204] L69-1-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] SleepPredicate [underlying: 119#[L70]don't care, sleep set: []] [217] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] SleepPredicate [underlying: 121#[L70-1]don't care, sleep set: []] [164] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_3|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0] SleepPredicate [underlying: 123#[L70-2]don't care, sleep set: []] [163] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] SleepPredicate [underlying: 125#[L71]don't care, sleep set: []] [148] L71-->L71-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] SleepPredicate [underlying: 127#[L71-1]don't care, sleep set: []] [159] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_3|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0] SleepPredicate [underlying: 129#[L71-2]don't care, sleep set: []] [200] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] SleepPredicate [underlying: 131#[L72]don't care, sleep set: []] [216] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] SleepPredicate [underlying: 133#[L72-1]don't care, sleep set: []] [143] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] SleepPredicate [underlying: 135#[L72-2]don't care, sleep set: []] [149] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] SleepPredicate [underlying: 137#[L75]don't care, sleep set: []] [209] L75-->L75-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, 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] SleepPredicate [underlying: 139#[L75-1]don't care, sleep set: []] [167] L75-1-->L33: 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] SleepPredicate [underlying: 141#[L33]don't care, sleep set: []] [160] L33-->L34: 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] SleepPredicate [underlying: 143#[L34]don't care, sleep set: []] [166] L34-->L33-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[] SleepPredicate [underlying: 147#[L33-1]don't care, sleep set: []] [195] L33-1-->L76: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, 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] SleepPredicate [underlying: 149#[L76]don't care, sleep set: []] [218] L76-->L33-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] SleepPredicate [underlying: 151#[L33-2]don't care, sleep set: []] [161] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 153#[L34-3]don't care, sleep set: []] [154] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 157#[L33-3]don't care, sleep set: []] [215] L33-3-->L78: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] SleepPredicate [underlying: 159#[L78]don't care, sleep set: []] [158] L78-->L78-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] SleepPredicate [underlying: 161#[L78-1]don't care, sleep set: []] [162] L78-1-->L78-2: 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~pre11#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#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~pre11#1=|v_ULTIMATE.start_main_#t~pre11#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] SleepPredicate [underlying: 163#[L78-2]don't care, sleep set: []] [234] L78-2-->L46: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_4|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_4|, 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_#t~post3, thread1Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] SleepPredicate [underlying: 165#[L46, L78-3]don't care, sleep set: []] [145] L78-3-->L78-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] SleepPredicate [underlying: 167#[L46, L78-4]don't care, sleep set: [thread1Thread1of1ForFork0]] [176] L78-4-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] SleepPredicate [underlying: 173#[L46, L79]don't care, sleep set: [thread1Thread1of1ForFork0]] [194] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] SleepPredicate [underlying: 181#[L46, L79-1]don't care, sleep set: [thread1Thread1of1ForFork0]] [186] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] SleepPredicate [underlying: 191#[L46, L79-2]don't care, sleep set: [thread1Thread1of1ForFork0]] [174] L79-2-->L79-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~pre13#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, 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|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, 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|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 201#[L46, L79-3]don't care, sleep set: [thread1Thread1of1ForFork0]] [237] L79-3-->L59: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5=|v_thread2Thread1of1ForFork1_#t~post5_4|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5, thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_#t~post6, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] SleepPredicate [underlying: 215#[L59, L79-4, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [201] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] SleepPredicate [underlying: 227#[L59, L79-5, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [152] L79-5-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] SleepPredicate [underlying: 251#[L59, L81, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [196] L81-->L81-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (= v_~pos~0_12 0)) 1 0)) InVars {~pos~0=v_~pos~0_12} OutVars{~pos~0=v_~pos~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 283#[L81-1, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [146] L81-1-->L33-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 327#[L33-4, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [147] L33-4-->L34-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 375#[L59, L34-6, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [193] L34-6-->L33-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 427#[L59, L33-5, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [184] L33-5-->L84: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 485#[L84, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [189] L84-->L66-3: Formula: (= |v_ULTIMATE.start_main_#res#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 547#[L66-3, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [178] L66-3-->L66-4: Formula: (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0) |v_#valid_10|) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid] SleepPredicate [underlying: 609#[L66-4, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [190] L66-4-->L66-5: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 669#[L66-5, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [191] L66-5-->L66-6: Formula: (= |v_#valid_12| (store |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) InVars {ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#valid] SleepPredicate [underlying: 723#[L66-6, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [177] L66-6-->main_returnLabel#1: Formula: true InVars {} OutVars{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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 775#[L59, main_returnLabel#1, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [210] main_returnLabel#1-->ULTIMATE.startFINAL: Formula: (= |v_ULTIMATE.start_main_#res#1_3| |v_ULTIMATE.start_#t~ret15#1_1|) InVars {ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} OutVars{ULTIMATE.start_#t~ret15#1=|v_ULTIMATE.start_#t~ret15#1_1|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret15#1] SleepPredicate [underlying: 825#[ULTIMATE.startFINAL, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [219] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 875#[ULTIMATE.startEXIT, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [220] L46-->L41: Formula: (< v_~i1~0_2 (* 2 v_~N~0_2)) InVars {~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} OutVars{~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] SleepPredicate [underlying: 885#[ULTIMATE.startEXIT, L59, L41]don't care, sleep set: []]
[2023-09-17 12:00:28,338 INFO L750 eck$LassoCheckResult]: Loop: SleepPredicate [underlying: 885#[ULTIMATE.startEXIT, L59, L41]don't care, sleep set: []] [226] L59-->L54: Formula: (< v_~i2~0_1 (* 2 v_~N~0_3)) InVars {~i2~0=v_~i2~0_1, ~N~0=v_~N~0_3} OutVars{~i2~0=v_~i2~0_1, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[] SleepPredicate [underlying: 933#[ULTIMATE.startEXIT, L41, L54]don't care, sleep set: [thread1Thread1of1ForFork0]] [223] L41-->L46: Formula: (and (= v_~pos~0_54 v_~pos~0_53) (= v_~i1~0_34 (+ v_~i1~0_36 2))) InVars {~i1~0=v_~i1~0_36, ~pos~0=v_~pos~0_54} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_1|, ~i1~0=v_~i1~0_34, ~pos~0=v_~pos~0_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_#t~post4, ~i1~0, ~pos~0] SleepPredicate [underlying: 925#[L54, ULTIMATE.startEXIT, L46]don't care, sleep set: []] [229] L54-->L59: Formula: (and (= v_~pos~0_45 v_~pos~0_43) (= v_~i2~0_34 (+ v_~i2~0_35 2))) InVars {~i2~0=v_~i2~0_35, ~pos~0=v_~pos~0_45} OutVars{thread2Thread1of1ForFork1_#t~post5=|v_thread2Thread1of1ForFork1_#t~post5_1|, ~i2~0=v_~i2~0_34, ~pos~0=v_~pos~0_43, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5, thread2Thread1of1ForFork1_#t~post6, ~i2~0, ~pos~0] SleepPredicate [underlying: 875#[ULTIMATE.startEXIT, L59, L46]don't care, sleep set: [thread1Thread1of1ForFork0]] [220] L46-->L41: Formula: (< v_~i1~0_2 (* 2 v_~N~0_2)) InVars {~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} OutVars{~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] SleepPredicate [underlying: 885#[ULTIMATE.startEXIT, L59, L41]don't care, sleep set: []]
[2023-09-17 12:00:28,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-09-17 12:00:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash 417542782, now seen corresponding path program 1 times
[2023-09-17 12:00:28,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-17 12:00:28,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639091798]
[2023-09-17 12:00:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-17 12:00:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-17 12:00:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-17 12:00:28,540 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 12:00:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-17 12:00:28,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639091798]
[2023-09-17 12:00:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639091798] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-17 12:00:28,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-17 12:00:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-09-17 12:00:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510920145]
[2023-09-17 12:00:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-17 12:00:28,548 INFO L753 eck$LassoCheckResult]: stem already infeasible
[2023-09-17 12:00:28,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-09-17 12:00:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash 7877909, now seen corresponding path program 1 times
[2023-09-17 12:00:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-17 12:00:28,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341042630]
[2023-09-17 12:00:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-17 12:00:28,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-17 12:00:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-09-17 12:00:28,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-09-17 12:00:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-09-17 12:00:28,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-09-17 12:00:28,650 INFO L210 LassoAnalysis]: Preferences:
[2023-09-17 12:00:28,651 INFO L126 ssoRankerPreferences]: Compute integeral hull: false
[2023-09-17 12:00:28,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-09-17 12:00:28,651 INFO L128 ssoRankerPreferences]: Term annotations enabled: false
[2023-09-17 12:00:28,652 INFO L129 ssoRankerPreferences]: Use exernal solver: true
[2023-09-17 12:00:28,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:28,653 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false
[2023-09-17 12:00:28,653 INFO L132 ssoRankerPreferences]: Path of dumped script:
[2023-09-17 12:00:28,653 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop
[2023-09-17 12:00:28,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank
[2023-09-17 12:00:28,654 INFO L276 LassoAnalysis]: Starting lasso preprocessing...
[2023-09-17 12:00:28,670 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 12:00:28,695 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 12:00:28,715 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 12:00:28,718 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 12:00:28,720 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 12:00:28,722 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 12:00:28,724 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 12:00:28,726 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 12:00:28,737 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 12:00:28,739 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 12:00:28,742 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 12:00:28,744 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 12:00:28,860 INFO L294 LassoAnalysis]: Preprocessing complete.
[2023-09-17 12:00:28,861 INFO L404 LassoAnalysis]: Checking for nontermination...
[2023-09-17 12:00:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-17 12:00:28,874 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 12:00:28,888 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 12:00:28,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2023-09-17 12:00:28,891 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2023-09-17 12:00:28,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0
[2023-09-17 12:00:28,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-17 12:00:28,920 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 12:00:28,922 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 12:00:28,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2023-09-17 12:00:28,939 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2023-09-17 12:00:29,268 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2023-09-17 12:00:29,276 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 12:00:29,276 INFO L210 LassoAnalysis]: Preferences:
[2023-09-17 12:00:29,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false
[2023-09-17 12:00:29,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-09-17 12:00:29,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false
[2023-09-17 12:00:29,276 INFO L129 ssoRankerPreferences]: Use exernal solver: false
[2023-09-17 12:00:29,276 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:29,276 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false
[2023-09-17 12:00:29,276 INFO L132 ssoRankerPreferences]: Path of dumped script:
[2023-09-17 12:00:29,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop
[2023-09-17 12:00:29,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank
[2023-09-17 12:00:29,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing...
[2023-09-17 12:00:29,278 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 12:00:29,281 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 12:00:29,293 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 12:00:29,296 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 12:00:29,299 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 12:00:29,301 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 12:00:29,302 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 12:00:29,304 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 12:00:29,306 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 12:00:29,308 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 12:00:29,311 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 12:00:29,313 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 12:00:29,384 INFO L294 LassoAnalysis]: Preprocessing complete.
[2023-09-17 12:00:29,387 INFO L490 LassoAnalysis]: Using template 'affine'.
[2023-09-17 12:00:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-17 12:00:29,395 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 12:00:29,396 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 12:00:29,397 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 12:00:29,404 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-09-17 12:00:29,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-09-17 12:00:29,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-09-17 12:00:29,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-09-17 12:00:29,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-09-17 12:00:29,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-09-17 12:00:29,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-09-17 12:00:29,445 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 12:00:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-17 12:00:29,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)
[2023-09-17 12:00:29,467 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 12:00:29,468 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 12:00:29,473 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2023-09-17 12:00:29,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2023-09-17 12:00:29,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2023-09-17 12:00:29,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2023-09-17 12:00:29,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2023-09-17 12:00:29,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2023-09-17 12:00:29,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2023-09-17 12:00:29,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2023-09-17 12:00:29,505 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2023-09-17 12:00:29,505 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero.
[2023-09-17 12:00:29,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-09-17 12:00:29,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-17 12:00:29,627 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)
[2023-09-17 12:00:29,632 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
[2023-09-17 12:00:29,635 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2023-09-17 12:00:29,635 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2023-09-17 12:00:29,635 INFO L513 LassoAnalysis]: Proved termination.
[2023-09-17 12:00:29,636 INFO L515 LassoAnalysis]: Termination argument consisting of:
Ranking function f(~i2~0, ~N~0) = -1*~i2~0 + 2*~N~0
Supporting invariants []
[2023-09-17 12:00:29,638 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 12:00:29,641 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2023-09-17 12:00:29,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-09-17 12:00:29,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2023-09-17 12:00:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-17 12:00:29,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-09-17 12:00:29,745 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-09-17 12:00:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-17 12:00:29,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-09-17 12:00:29,831 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-09-17 12:00:29,877 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 12:00:29,897 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates
[2023-09-17 12:00:29,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 12:00:30,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 6878 states and 23699 transitions. Complement of second has 7 states.
[2023-09-17 12:00:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2023-09-17 12:00:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 12:00:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions.
[2023-09-17 12:00:30,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 183 transitions. Stem has 60 letters. Loop has 4 letters.
[2023-09-17 12:00:30,466 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2023-09-17 12:00:30,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 183 transitions. Stem has 64 letters. Loop has 4 letters.
[2023-09-17 12:00:30,466 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2023-09-17 12:00:30,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 183 transitions. Stem has 60 letters. Loop has 8 letters.
[2023-09-17 12:00:30,467 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2023-09-17 12:00:30,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6878 states and 23699 transitions.
[2023-09-17 12:00:30,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2023-09-17 12:00:30,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6878 states to 0 states and 0 transitions.
[2023-09-17 12:00:30,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2023-09-17 12:00:30,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2023-09-17 12:00:30,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2023-09-17 12:00:30,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-17 12:00:30,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-09-17 12:00:30,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-09-17 12:00:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-17 12:00:30,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-09-17 12:00:30,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-09-17 12:00:30,602 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 12:00:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-09-17 12:00:30,604 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2023-09-17 12:00:30,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions.
[2023-09-17 12:00:30,604 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2023-09-17 12:00:30,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions.
[2023-09-17 12:00:30,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2023-09-17 12:00:30,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2023-09-17 12:00:30,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2023-09-17 12:00:30,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-09-17 12:00:30,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-09-17 12:00:30,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-09-17 12:00:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-09-17 12:00:30,605 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-09-17 12:00:30,606 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2023-09-17 12:00:30,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2023-09-17 12:00:30,606 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2023-09-17 12:00:30,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2023-09-17 12:00:30,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 12:00:30 BoogieIcfgContainer
[2023-09-17 12:00:30,612 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2023-09-17 12:00:30,613 INFO L158 Benchmark]: Toolchain (without parser) took 3884.05ms. Allocated memory was 185.6MB in the beginning and 349.2MB in the end (delta: 163.6MB). Free memory was 132.5MB in the beginning and 208.5MB in the end (delta: -75.9MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB.
[2023-09-17 12:00:30,613 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-09-17 12:00:30,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.58ms. Allocated memory is still 185.6MB. Free memory was 132.5MB in the beginning and 121.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2023-09-17 12:00:30,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.32ms. Allocated memory is still 185.6MB. Free memory was 121.4MB in the beginning and 120.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-09-17 12:00:30,615 INFO L158 Benchmark]: Boogie Preprocessor took 25.83ms. Allocated memory is still 185.6MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-09-17 12:00:30,615 INFO L158 Benchmark]: RCFGBuilder took 354.56ms. Allocated memory was 185.6MB in the beginning and 290.5MB in the end (delta: 104.9MB). Free memory was 118.7MB in the beginning and 260.9MB in the end (delta: -142.1MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB.
[2023-09-17 12:00:30,616 INFO L158 Benchmark]: BuchiAutomizer took 3302.81ms. Allocated memory was 290.5MB in the beginning and 349.2MB in the end (delta: 58.7MB). Free memory was 260.9MB in the beginning and 208.5MB in the end (delta: 52.4MB). Peak memory consumption was 111.7MB. Max. memory is 8.0GB.
[2023-09-17 12:00:30,618 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.11ms. Allocated memory is still 185.6MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 160.58ms. Allocated memory is still 185.6MB. Free memory was 132.5MB in the beginning and 121.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 35.32ms. Allocated memory is still 185.6MB. Free memory was 121.4MB in the beginning and 120.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 25.83ms. Allocated memory is still 185.6MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 354.56ms. Allocated memory was 185.6MB in the beginning and 290.5MB in the end (delta: 104.9MB). Free memory was 118.7MB in the beginning and 260.9MB in the end (delta: -142.1MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB.
* BuchiAutomizer took 3302.81ms. Allocated memory was 290.5MB in the beginning and 349.2MB in the end (delta: 58.7MB). Free memory was 260.9MB in the beginning and 208.5MB in the end (delta: 52.4MB). Peak memory consumption was 111.7MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Constructed decomposition of program
Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * N + -1 * i2 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations.
- StatisticsResult: Timing statistics
BüchiAutomizer plugin needed 3.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s 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, 96 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 85 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax227 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf106 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s
- TerminationAnalysisResult: Termination proven
Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2023-09-17 12:00:30,634 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...