/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 03:39:50,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 03:39:50,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 03:39:50,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 03:39:50,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 03:39:50,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 03:39:50,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 03:39:50,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 03:39:50,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 03:39:50,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 03:39:50,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 03:39:50,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 03:39:50,820 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 03:39:50,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 03:39:50,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 03:39:50,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 03:39:50,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 03:39:50,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 03:39:50,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 03:39:50,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 03:39:50,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 03:39:50,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 03:39:50,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 03:39:50,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 03:39:50,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 03:39:50,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 03:39:50,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 03:39:50,825 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 03:39:50,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 03:39:50,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 03:39:50,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 03:39:50,827 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 03:39:50,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 03:39:51,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 03:39:51,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 03:39:51,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 03:39:51,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 03:39:51,039 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 03:39:51,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2024-05-07 03:39:52,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 03:39:52,235 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 03:39:52,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2024-05-07 03:39:52,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ce9c53b5b/74fb8842ce8a44e8820f87274cc2bc9d/FLAG8a8d6ee7d [2024-05-07 03:39:52,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ce9c53b5b/74fb8842ce8a44e8820f87274cc2bc9d [2024-05-07 03:39:52,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 03:39:52,265 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 03:39:52,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 03:39:52,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 03:39:52,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 03:39:52,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3334b9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52, skipping insertion in model container [2024-05-07 03:39:52,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,318 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 03:39:52,741 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-05-07 03:39:52,748 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-05-07 03:39:52,752 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-05-07 03:39:52,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 03:39:52,769 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 03:39:52,806 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-05-07 03:39:52,808 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-05-07 03:39:52,814 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-05-07 03:39:52,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 03:39:52,877 INFO L206 MainTranslator]: Completed translation [2024-05-07 03:39:52,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52 WrapperNode [2024-05-07 03:39:52,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 03:39:52,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 03:39:52,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 03:39:52,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 03:39:52,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,943 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-05-07 03:39:52,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 03:39:52,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 03:39:52,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 03:39:52,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 03:39:52,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:52,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 03:39:52,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 03:39:52,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 03:39:52,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 03:39:52,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (1/1) ... [2024-05-07 03:39:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 03:39:53,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:39:53,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 03:39:53,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 03:39:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-07 03:39:53,086 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-07 03:39:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-07 03:39:53,086 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-07 03:39:53,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 03:39:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 03:39:53,087 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-07 03:39:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 03:39:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 03:39:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-07 03:39:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 03:39:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 03:39:53,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 03:39:53,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 03:39:53,089 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 03:39:53,210 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 03:39:53,212 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 03:39:53,533 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 03:39:53,555 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 03:39:53,555 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-07 03:39:53,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 03:39:53 BoogieIcfgContainer [2024-05-07 03:39:53,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 03:39:53,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 03:39:53,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 03:39:53,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 03:39:53,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 03:39:52" (1/3) ... [2024-05-07 03:39:53,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1533ce12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 03:39:53, skipping insertion in model container [2024-05-07 03:39:53,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:39:52" (2/3) ... [2024-05-07 03:39:53,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1533ce12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 03:39:53, skipping insertion in model container [2024-05-07 03:39:53,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 03:39:53" (3/3) ... [2024-05-07 03:39:53,562 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-05-07 03:39:53,568 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 03:39:53,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 03:39:53,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-07 03:39:53,576 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 03:39:53,668 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 03:39:53,713 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 03:39:53,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 03:39:53,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:39:53,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 03:39:53,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 03:39:53,750 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 03:39:53,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:39:53,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 03:39:53,771 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fe8a5fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 03:39:53,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-07 03:39:53,802 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:39:53,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:39:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 354382951, now seen corresponding path program 1 times [2024-05-07 03:39:53,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:39:53,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036050239] [2024-05-07 03:39:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:39:53,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:39:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:39:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:39:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:39:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036050239] [2024-05-07 03:39:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036050239] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:39:54,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:39:54,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 03:39:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385042689] [2024-05-07 03:39:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:39:54,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 03:39:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:39:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 03:39:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 03:39:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:54,043 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:39:54,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:39:54,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:54,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 03:39:54,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:39:54,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:39:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 988144468, now seen corresponding path program 1 times [2024-05-07 03:39:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:39:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832139700] [2024-05-07 03:39:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:39:54,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:39:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:39:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:39:54,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:39:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832139700] [2024-05-07 03:39:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832139700] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:39:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:39:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 03:39:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36158957] [2024-05-07 03:39:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:39:54,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 03:39:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:39:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 03:39:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 03:39:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:54,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:39:54,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:39:54,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:54,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:54,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 03:39:54,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:39:54,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:39:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2145678791, now seen corresponding path program 1 times [2024-05-07 03:39:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:39:54,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247883180] [2024-05-07 03:39:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:39:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:39:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:39:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:39:55,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:39:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247883180] [2024-05-07 03:39:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247883180] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:39:55,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:39:55,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-05-07 03:39:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271887585] [2024-05-07 03:39:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:39:55,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-07 03:39:55,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:39:55,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-07 03:39:55,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-05-07 03:39:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:55,578 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:39:55,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:39:55,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:55,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:55,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:39:55,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-07 03:39:55,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:39:55,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:39:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1468984428, now seen corresponding path program 1 times [2024-05-07 03:39:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:39:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603419639] [2024-05-07 03:39:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:39:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:39:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:39:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:39:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:39:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603419639] [2024-05-07 03:39:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603419639] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:39:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:39:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-05-07 03:39:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081799284] [2024-05-07 03:39:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:39:57,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-07 03:39:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:39:57,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-07 03:39:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2024-05-07 03:39:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:57,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:39:57,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 27 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:39:57,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:57,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:57,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:39:57,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:39:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-07 03:39:58,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-07 03:39:58,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:39:58,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:39:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1786371939, now seen corresponding path program 1 times [2024-05-07 03:39:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:39:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801561259] [2024-05-07 03:39:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:39:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:39:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:39:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:39:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:39:58,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801561259] [2024-05-07 03:39:58,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801561259] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:39:58,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:39:58,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 03:39:58,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557895889] [2024-05-07 03:39:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:39:58,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 03:39:58,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:39:58,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 03:39:58,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 03:39:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:58,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:39:58,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:39:58,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:58,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:58,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:39:58,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-07 03:39:58,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:39:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:39:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:39:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:39:58,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-07 03:39:58,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:39:58,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:39:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1917543094, now seen corresponding path program 1 times [2024-05-07 03:39:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:39:58,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517967861] [2024-05-07 03:39:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:39:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:39:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:40:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:40:01,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:40:01,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517967861] [2024-05-07 03:40:01,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517967861] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:40:01,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:40:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2024-05-07 03:40:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62021281] [2024-05-07 03:40:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:40:01,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-07 03:40:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:40:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-07 03:40:01,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-05-07 03:40:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:01,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:40:01,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.6) internal successors, (198), 30 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:40:01,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:01,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:01,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:40:01,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:40:01,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:01,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:40:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:40:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-07 03:40:02,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-07 03:40:02,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:40:02,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:40:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 145069809, now seen corresponding path program 1 times [2024-05-07 03:40:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:40:02,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293828292] [2024-05-07 03:40:02,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:40:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:40:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:40:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:40:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:40:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293828292] [2024-05-07 03:40:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293828292] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:40:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:40:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2024-05-07 03:40:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561930092] [2024-05-07 03:40:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:40:05,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-07 03:40:05,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:40:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-07 03:40:05,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2024-05-07 03:40:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:05,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:40:05,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.17948717948718) internal successors, (202), 39 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:40:05,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:05,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:05,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:40:05,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:40:05,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:05,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-07 03:40:05,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:40:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:40:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-07 03:40:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-07 03:40:07,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-07 03:40:07,780 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:40:07,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:40:07,781 INFO L85 PathProgramCache]: Analyzing trace with hash 272690006, now seen corresponding path program 1 times [2024-05-07 03:40:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:40:07,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127843846] [2024-05-07 03:40:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:40:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:40:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:40:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:40:12,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:40:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127843846] [2024-05-07 03:40:12,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127843846] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 03:40:12,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 03:40:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2024-05-07 03:40:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270892266] [2024-05-07 03:40:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 03:40:12,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-05-07 03:40:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:40:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-05-07 03:40:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=0, NotChecked=0, Total=2450 [2024-05-07 03:40:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:12,487 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:40:12,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.12) internal successors, (206), 50 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:40:12,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:12,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:12,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:40:12,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:40:12,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:12,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-07 03:40:12,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-07 03:40:12,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-07 03:40:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-07 03:40:16,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-07 03:40:16,590 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:40:16,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:40:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash -680365112, now seen corresponding path program 1 times [2024-05-07 03:40:16,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:40:16,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739035109] [2024-05-07 03:40:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:40:16,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:40:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:40:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:40:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:40:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739035109] [2024-05-07 03:40:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739035109] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 03:40:20,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332253668] [2024-05-07 03:40:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:40:20,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:40:20,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:40:20,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 03:40:20,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 03:40:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:40:20,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 104 conjunts are in the unsatisfiable core [2024-05-07 03:40:20,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 03:40:20,491 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-07 03:40:20,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-07 03:40:20,533 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 03:40:20,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-07 03:40:20,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-07 03:40:20,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-05-07 03:40:21,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-07 03:40:21,380 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-05-07 03:40:21,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2024-05-07 03:40:21,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-05-07 03:40:21,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-07 03:40:21,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:40:21,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 03:40:21,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 03:40:22,254 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-05-07 03:40:22,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-05-07 03:40:22,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-05-07 03:40:22,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-05-07 03:40:22,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:40:22,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 03:40:22,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-05-07 03:40:22,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-05-07 03:40:23,088 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-05-07 03:40:23,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-05-07 03:40:23,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-05-07 03:40:23,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-07 03:40:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:40:23,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 03:40:23,636 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2024-05-07 03:40:23,733 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 Int) (v_ArrVal_410 (Array Int Int))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_408) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800))) is different from false [2024-05-07 03:40:40,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_404))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (= 800 .cse2) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) .cse1) 800) (< (+ .cse2 1) v_ArrVal_408))))))) is different from false [2024-05-07 03:40:41,077 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_403) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_404) |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse3 .cse2))) (or (< (+ .cse0 1) v_ArrVal_408) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_404) |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_406) .cse2 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|) .cse2) 800) (= 800 .cse0)))))) is different from false [2024-05-07 03:40:50,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:40:50,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 432 treesize of output 287 [2024-05-07 03:40:50,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:40:50,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 998 treesize of output 994 [2024-05-07 03:40:50,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 228 [2024-05-07 03:40:50,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 616 treesize of output 568 [2024-05-07 03:40:50,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 596 treesize of output 572 [2024-05-07 03:40:50,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:40:50,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 8 [2024-05-07 03:40:50,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:40:50,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 278 treesize of output 280 [2024-05-07 03:40:51,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 03:40:52,339 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-05-07 03:40:52,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-05-07 03:40:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:40:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332253668] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 03:40:52,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 03:40:52,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35, 40] total 109 [2024-05-07 03:40:52,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501729336] [2024-05-07 03:40:52,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 03:40:52,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2024-05-07 03:40:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:40:52,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2024-05-07 03:40:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=9708, Unknown=173, NotChecked=836, Total=11772 [2024-05-07 03:40:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:52,445 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:40:52,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 6.660550458715596) internal successors, (726), 109 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-07 03:40:52,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:41:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-07 03:41:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-07 03:41:09,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-07 03:41:09,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-07 03:41:09,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:41:09,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:41:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1926876931, now seen corresponding path program 1 times [2024-05-07 03:41:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:41:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584315464] [2024-05-07 03:41:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:41:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:41:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:41:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:41:14,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 03:41:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584315464] [2024-05-07 03:41:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584315464] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 03:41:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546673599] [2024-05-07 03:41:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:41:14,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 03:41:14,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 03:41:14,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 03:41:14,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 03:41:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 03:41:15,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 125 conjunts are in the unsatisfiable core [2024-05-07 03:41:15,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 03:41:15,136 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-07 03:41:15,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-07 03:41:15,183 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 03:41:15,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-05-07 03:41:15,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-07 03:41:15,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-05-07 03:41:15,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-05-07 03:41:15,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 03:41:16,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:16,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:16,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:16,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-05-07 03:41:16,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-05-07 03:41:16,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-05-07 03:41:16,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:16,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-07 03:41:17,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-07 03:41:17,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:17,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-05-07 03:41:17,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 03:41:17,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-05-07 03:41:17,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:17,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-07 03:41:18,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 03:41:18,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-05-07 03:41:18,757 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-05-07 03:41:18,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2024-05-07 03:41:18,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-05-07 03:41:18,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-05-07 03:41:18,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 03:41:18,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-07 03:41:19,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-05-07 03:41:19,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-07 03:41:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 03:41:19,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 03:41:19,401 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) is different from false [2024-05-07 03:41:35,707 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_568 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_566) .cse4 v_ArrVal_568)))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_568) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800)))))) is different from false [2024-05-07 03:41:35,777 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (v_ArrVal_568 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_566) .cse5 v_ArrVal_568)))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse3 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_568) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))))) is different from false [2024-05-07 03:41:35,806 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (v_ArrVal_568 Int)) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_566) .cse4 v_ArrVal_568)))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_568) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse2 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse1) 800)))))) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))) is different from false [2024-05-07 03:41:35,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_575 Int) (v_ArrVal_570 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (v_ArrVal_568 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_566) .cse3 v_ArrVal_568)))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_575) .cse5 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse6 .cse3) 1) v_ArrVal_568) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-05-07 03:41:57,173 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) is different from false [2024-05-07 03:41:57,505 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (= |c_t1Thread1of1ForFork1_empty_#t~mem32#1| |c_t1Thread1of1ForFork1_empty_#t~mem31#1|)) is different from false [2024-05-07 03:41:57,529 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_~q#1.base|) (+ |c_t1Thread1of1ForFork1_empty_~q#1.offset| 3204)) |c_t1Thread1of1ForFork1_empty_#t~mem31#1|)) is different from false [2024-05-07 03:41:57,768 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_#in~q#1.base|))) (= (select .cse7 (+ |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| 3204)) (select .cse7 (+ |c_t1Thread1of1ForFork1_empty_#in~q#1.offset| 3200))))) is different from false [2024-05-07 03:41:57,868 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|))))))) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse7 .cse1) (select .cse7 .cse3))))) is different from false [2024-05-07 03:41:57,897 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse2 (select (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse4) (select .cse5 .cse1))) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse8 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse4) 800))))))) is different from false [2024-05-07 03:41:58,131 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse8 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse5 (select (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse3 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse0 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse4 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse2) (select .cse7 .cse1)))))))))) is different from false [2024-05-07 03:41:58,161 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (let ((.cse4 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse5 (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse6 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse6 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse8 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800)))))))) is different from false [2024-05-07 03:41:58,195 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse7 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse8 (select (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse1) (select .cse6 .cse3))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-05-07 03:41:58,355 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse6 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse7 (select (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_566) .cse4 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse3 v_ArrVal_575) .cse4 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse2) 800) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse2) (select .cse5 .cse4))) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (+ (select .cse8 .cse4) 1) v_ArrVal_568) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))))))) is different from false [2024-05-07 03:41:58,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse11 (+ (select .cse10 .cse11) 1)))))) (let ((.cse4 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse8 (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse6 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse7 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select .cse6 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|)))))))) is different from false [2024-05-07 03:41:58,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse12 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ 1 (select .cse12 .cse1))))))) (let ((.cse8 (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse4 (select (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_566) .cse3 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse6 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_568) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse5 .cse6) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse3) (select .cse7 .cse6))) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse10 v_ArrVal_575) .cse3 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse6) 800))))))))))) is different from false [2024-05-07 03:41:58,627 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse12 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse12 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ 1 (select .cse12 .cse6))))))) (let ((.cse4 (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse10 (select (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse7 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 .cse3))) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse0 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_568) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse9 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-05-07 03:42:09,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse11 .cse5 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse0 (select (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse4 (+ 3200 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse5 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse4) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse4) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse1) (select .cse8 .cse4))))))))))) is different from false [2024-05-07 03:42:11,467 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| Int) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_566 Int) (v_ArrVal_577 Int) (v_ArrVal_579 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_38| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3204) 0) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_559))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse11 .cse7 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_563))) (let ((.cse9 (select (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564) |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_564)) (.cse0 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_38|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_566) .cse1 v_ArrVal_568)) |c_~#stored_elements~0.base| v_ArrVal_570) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_568) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (= (select .cse4 .cse3) (select .cse4 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork0_dequeue_#t~post48#1_24| 1)) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse7 v_ArrVal_575) .cse1 v_ArrVal_577)) |c_~#stored_elements~0.base| v_ArrVal_579) |c_~#queue~0.base|) .cse3) 800) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_46|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|))))))))) is different from false [2024-05-07 03:42:11,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:42:11,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1105 treesize of output 615 [2024-05-07 03:42:11,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:42:11,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1932 treesize of output 1904 [2024-05-07 03:42:11,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 594 [2024-05-07 03:42:11,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 714 [2024-05-07 03:42:11,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 520 [2024-05-07 03:42:11,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-05-07 03:42:11,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:42:11,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 12 [2024-05-07 03:42:13,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 03:42:13,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 887 treesize of output 855 [2024-05-07 03:42:14,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-05-07 03:42:15,614 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-05-07 03:42:15,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2024-05-07 03:42:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2024-05-07 03:42:15,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546673599] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 03:42:15,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 03:42:15,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44, 53] total 141 [2024-05-07 03:42:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010012566] [2024-05-07 03:42:15,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 03:42:15,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2024-05-07 03:42:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 03:42:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2024-05-07 03:42:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1375, Invalid=13059, Unknown=166, NotChecked=5140, Total=19740 [2024-05-07 03:42:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:42:15,687 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 03:42:15,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 141 states have (on average 5.75886524822695) internal successors, (812), 141 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-07 03:42:15,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-07 03:42:15,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-07 03:42:15,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:42:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-07 03:42:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-05-07 03:42:39,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 03:42:39,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-07 03:42:39,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-07 03:42:39,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 03:42:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1452722792, now seen corresponding path program 1 times [2024-05-07 03:42:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 03:42:39,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511255480] [2024-05-07 03:42:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 03:42:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 03:42:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2024-05-07 03:51:28,483 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 03:51:28,483 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 03:51:28,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-07 03:51:28,530 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:340) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-05-07 03:51:28,533 INFO L158 Benchmark]: Toolchain (without parser) took 696268.49ms. Allocated memory was 195.0MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 129.7MB in the beginning and 1.1GB in the end (delta: -968.4MB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2024-05-07 03:51:28,533 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 03:51:28,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.08ms. Allocated memory is still 195.0MB. Free memory was 129.6MB in the beginning and 150.7MB in the end (delta: -21.0MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2024-05-07 03:51:28,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.15ms. Allocated memory is still 195.0MB. Free memory was 150.7MB in the beginning and 147.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 03:51:28,534 INFO L158 Benchmark]: Boogie Preprocessor took 51.13ms. Allocated memory is still 195.0MB. Free memory was 147.5MB in the beginning and 144.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 03:51:28,534 INFO L158 Benchmark]: RCFGBuilder took 561.16ms. Allocated memory is still 195.0MB. Free memory was 144.9MB in the beginning and 119.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-07 03:51:28,534 INFO L158 Benchmark]: TraceAbstraction took 694974.85ms. Allocated memory was 195.0MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 117.6MB in the beginning and 1.1GB in the end (delta: -980.5MB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. [2024-05-07 03:51:28,535 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 612.08ms. Allocated memory is still 195.0MB. Free memory was 129.6MB in the beginning and 150.7MB in the end (delta: -21.0MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.15ms. Allocated memory is still 195.0MB. Free memory was 150.7MB in the beginning and 147.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.13ms. Allocated memory is still 195.0MB. Free memory was 147.5MB in the beginning and 144.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 561.16ms. Allocated memory is still 195.0MB. Free memory was 144.9MB in the beginning and 119.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 694974.85ms. Allocated memory was 195.0MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 117.6MB in the beginning and 1.1GB in the end (delta: -980.5MB). Peak memory consumption was 4.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown