/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-fffa3fa-m [2023-09-04 21:30:12,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-04 21:30:12,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-04 21:30:12,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-04 21:30:12,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-04 21:30:12,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-04 21:30:12,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-04 21:30:12,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-04 21:30:12,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-04 21:30:12,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-04 21:30:12,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-04 21:30:12,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-04 21:30:12,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-04 21:30:12,556 INFO L153 SettingsManager]: * Use SBE=true [2023-09-04 21:30:12,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-04 21:30:12,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-04 21:30:12,558 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-04 21:30:12,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-04 21:30:12,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-04 21:30:12,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-04 21:30:12,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-04 21:30:12,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-04 21:30:12,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-04 21:30:12,560 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-04 21:30:12,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-04 21:30:12,561 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-04 21:30:12,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-04 21:30:12,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-04 21:30:12,562 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-04 21:30:12,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-04 21:30:12,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-04 21:30:12,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-04 21:30:12,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-04 21:30:12,563 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-04 21:30:12,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-04 21:30:12,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-04 21:30:12,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-04 21:30:12,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-04 21:30:12,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-04 21:30:12,564 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-04 21:30:12,564 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-04 21:30:12,564 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/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-09-04 21:30:12,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-04 21:30:12,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-04 21:30:12,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-04 21:30:12,811 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-04 21:30:12,811 INFO L274 PluginConnector]: CDTParser initialized [2023-09-04 21:30:12,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-09-04 21:30:13,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-04 21:30:14,198 INFO L384 CDTParser]: Found 1 translation units. [2023-09-04 21:30:14,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-09-04 21:30:14,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4a89276/449ff5a8d0c6445ba5424887da6a9d01/FLAGdc4a847de [2023-09-04 21:30:14,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4a89276/449ff5a8d0c6445ba5424887da6a9d01 [2023-09-04 21:30:14,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-04 21:30:14,236 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-04 21:30:14,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-04 21:30:14,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-04 21:30:14,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-04 21:30:14,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea8c4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14, skipping insertion in model container [2023-09-04 21:30:14,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,296 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-09-04 21:30:14,655 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] [2023-09-04 21:30:14,659 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] [2023-09-04 21:30:14,665 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] [2023-09-04 21:30:14,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-04 21:30:14,681 INFO L201 MainTranslator]: Completed pre-run [2023-09-04 21:30:14,706 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-04 21:30:14,707 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-04 21:30:14,713 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-04 21:30:14,739 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] [2023-09-04 21:30:14,742 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] [2023-09-04 21:30:14,750 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] [2023-09-04 21:30:14,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-04 21:30:14,816 INFO L206 MainTranslator]: Completed translation [2023-09-04 21:30:14,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14 WrapperNode [2023-09-04 21:30:14,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-04 21:30:14,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-04 21:30:14,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-04 21:30:14,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-04 21:30:14,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,873 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-09-04 21:30:14,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-04 21:30:14,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-04 21:30:14,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-04 21:30:14,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-04 21:30:14,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-04 21:30:14,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-04 21:30:14,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-04 21:30:14,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-04 21:30:14,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-04 21:30:14,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:30:14,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-04 21:30:14,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-04 21:30:15,006 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-04 21:30:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-04 21:30:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-04 21:30:15,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-04 21:30:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-04 21:30:15,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-04 21:30:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-04 21:30:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-04 21:30:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-04 21:30:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-04 21:30:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-04 21:30:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-04 21:30:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-04 21:30:15,010 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-04 21:30:15,158 INFO L236 CfgBuilder]: Building ICFG [2023-09-04 21:30:15,159 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-04 21:30:15,526 INFO L277 CfgBuilder]: Performing block encoding [2023-09-04 21:30:15,534 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-04 21:30:15,534 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-04 21:30:15,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:30:15 BoogieIcfgContainer [2023-09-04 21:30:15,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-04 21:30:15,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-04 21:30:15,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-04 21:30:15,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-04 21:30:15,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:30:14" (1/3) ... [2023-09-04 21:30:15,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a5702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:30:15, skipping insertion in model container [2023-09-04 21:30:15,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14" (2/3) ... [2023-09-04 21:30:15,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a5702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:30:15, skipping insertion in model container [2023-09-04 21:30:15,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:30:15" (3/3) ... [2023-09-04 21:30:15,543 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-09-04 21:30:15,549 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-04 21:30:15,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-04 21:30:15,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-09-04 21:30:15,558 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-04 21:30:15,687 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-04 21:30:15,722 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-04 21:30:15,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-04 21:30:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:30:15,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-04 21:30:15,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-04 21:30:15,769 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-04 21:30:15,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-04 21:30:15,785 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=LoopsAndPotentialCycles, 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;@666e075d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-04 21:30:15,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-04 21:30:15,814 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)] === [2023-09-04 21:30:15,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1389819344, now seen corresponding path program 1 times [2023-09-04 21:30:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:15,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641836591] [2023-09-04 21:30:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:15,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641836591] [2023-09-04 21:30:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641836591] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:16,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:16,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-04 21:30:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611032821] [2023-09-04 21:30:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-04 21:30:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-04 21:30:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-04 21:30:16,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,117 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:16,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:16,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-04 21:30:16,192 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)] === [2023-09-04 21:30:16,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1534507384, now seen corresponding path program 1 times [2023-09-04 21:30:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818581973] [2023-09-04 21:30:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:16,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:16,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818581973] [2023-09-04 21:30:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818581973] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:16,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-04 21:30:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988198468] [2023-09-04 21:30:16,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:16,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-04 21:30:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-04 21:30:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-04 21:30:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:16,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:16,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:16,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-04 21:30:16,469 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)] === [2023-09-04 21:30:16,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236260, now seen corresponding path program 1 times [2023-09-04 21:30:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219633358] [2023-09-04 21:30:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219633358] [2023-09-04 21:30:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219633358] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:18,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-09-04 21:30:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495392243] [2023-09-04 21:30:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:18,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-04 21:30:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-04 21:30:18,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-09-04 21:30:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:18,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:18,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:18,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:18,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:19,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-04 21:30:19,680 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)] === [2023-09-04 21:30:19,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash 934072322, now seen corresponding path program 1 times [2023-09-04 21:30:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:19,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597715860] [2023-09-04 21:30:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:23,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:23,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597715860] [2023-09-04 21:30:23,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597715860] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:23,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:23,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-09-04 21:30:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388776459] [2023-09-04 21:30:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:23,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-04 21:30:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:23,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-04 21:30:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2023-09-04 21:30:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:23,110 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:23,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:23,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:23,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:23,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:23,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-04 21:30:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-04 21:30:25,665 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)] === [2023-09-04 21:30:25,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1713858353, now seen corresponding path program 1 times [2023-09-04 21:30:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539303223] [2023-09-04 21:30:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539303223] [2023-09-04 21:30:25,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539303223] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:25,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:25,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-04 21:30:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544614843] [2023-09-04 21:30:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:25,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-04 21:30:25,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-04 21:30:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-04 21:30:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:25,749 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:25,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-09-04 21:30:25,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:30:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:30:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-04 21:30:26,142 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)] === [2023-09-04 21:30:26,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1273290990, now seen corresponding path program 1 times [2023-09-04 21:30:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589888046] [2023-09-04 21:30:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-09-04 21:30:26,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589888046] [2023-09-04 21:30:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589888046] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:26,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-04 21:30:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122033752] [2023-09-04 21:30:26,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:26,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-04 21:30:26,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:26,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-04 21:30:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-04 21:30:26,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:26,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:26,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:26,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:26,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:26,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:30:26,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:30:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:30:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:26,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-04 21:30:26,483 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)] === [2023-09-04 21:30:26,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 923390222, now seen corresponding path program 2 times [2023-09-04 21:30:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229000841] [2023-09-04 21:30:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:26,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229000841] [2023-09-04 21:30:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229000841] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:26,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-04 21:30:26,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324301654] [2023-09-04 21:30:26,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:26,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-04 21:30:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:26,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-04 21:30:26,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-04 21:30:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:26,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:26,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:26,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:26,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:26,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:30:26,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:26,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:30:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:30:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:26,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-04 21:30:26,652 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)] === [2023-09-04 21:30:26,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -226095519, now seen corresponding path program 1 times [2023-09-04 21:30:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:26,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060359530] [2023-09-04 21:30:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-04 21:30:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060359530] [2023-09-04 21:30:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060359530] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 21:30:32,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128223330] [2023-09-04 21:30:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:32,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 21:30:32,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:30:32,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 21:30:32,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-04 21:30:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:32,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 104 conjunts are in the unsatisfiable core [2023-09-04 21:30:32,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 21:30:32,623 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-04 21:30:32,624 INFO L351 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 17 treesize of output 21 [2023-09-04 21:30:32,701 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-04 21:30:32,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-04 21:30:32,956 INFO L351 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 11 treesize of output 7 [2023-09-04 21:30:33,059 INFO L351 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 [2023-09-04 21:30:33,166 INFO L351 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 [2023-09-04 21:30:33,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-04 21:30:33,742 INFO L351 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 21 treesize of output 21 [2023-09-04 21:30:34,257 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-09-04 21:30:34,259 INFO L351 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2023-09-04 21:30:34,329 INFO L351 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 [2023-09-04 21:30:34,675 INFO L351 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 35 treesize of output 26 [2023-09-04 21:30:34,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:30:34,816 INFO L351 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 21 treesize of output 21 [2023-09-04 21:30:35,432 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-09-04 21:30:35,433 INFO L351 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 35 treesize of output 33 [2023-09-04 21:30:35,491 INFO L351 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 [2023-09-04 21:30:35,591 INFO L351 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 [2023-09-04 21:30:35,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:30:35,688 INFO L351 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 14 treesize of output 16 [2023-09-04 21:30:36,098 INFO L351 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 [2023-09-04 21:30:36,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-09-04 21:30:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-09-04 21:30:36,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 21:30:37,793 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_386) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse1 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2023-09-04 21:30:37,811 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_386) (not (= 800 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse1 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))))))) is different from false [2023-09-04 21:30:37,830 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_386) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse1 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))) is different from false [2023-09-04 21:30:37,861 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_386) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse1 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2023-09-04 21:30:38,101 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (or (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse1 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (+ .cse3 1) v_ArrVal_386))))) (= 800 .cse3)))) is different from false [2023-09-04 21:30:38,177 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_382)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse4 .cse5)) (.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ .cse0 1) v_ArrVal_386) (not (= 800 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse3 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|)))))) is different from false [2023-09-04 21:30:38,205 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse6 .cse5) 4)) v_ArrVal_382)))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse4 .cse5)) (.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ .cse0 1) v_ArrVal_386) (= .cse0 800) (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse3 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|))))))) is different from false [2023-09-04 21:30:38,275 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse6 .cse5))) v_ArrVal_382)))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse4 .cse5)) (.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (+ .cse0 1) v_ArrVal_386) (= 800 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))) is different from false [2023-09-04 21:30:39,219 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_381))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) v_ArrVal_382))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_384) .cse2 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse2))) (or (< (+ .cse0 1) v_ArrVal_386) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) .cse4 v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 .cse0))))))) is different from false [2023-09-04 21:30:39,336 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_381))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse2))) v_ArrVal_382))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_384) .cse2 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse2))) (or (= 800 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) .cse4 v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ .cse0 1) v_ArrVal_386))))))) is different from false [2023-09-04 21:30:39,709 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_378 Int) (v_ArrVal_389 Int) (v_ArrVal_386 Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_378)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_381))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_382))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_384) .cse1 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (= 800 .cse2) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) .cse4 v_ArrVal_391) .cse1 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ .cse2 1) v_ArrVal_386))))))) is different from false [2023-09-04 21:30:39,756 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_378 Int) (v_ArrVal_389 Int) (v_ArrVal_376 Int) (v_ArrVal_386 Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (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) v_ArrVal_376) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_378)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_381))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_382))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse1 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_384) .cse4 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse5 .cse4)) (.cse2 (select .cse1 |c_~#queue~0.base|))) (or (< 0 v_ArrVal_376) (< (+ .cse0 1) v_ArrVal_386) (= 800 .cse0) (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) .cse3 v_ArrVal_391) .cse4 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|))))))) is different from false [2023-09-04 21:30:39,777 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:39,777 INFO L351 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 522 treesize of output 292 [2023-09-04 21:30:39,799 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:39,800 INFO L351 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 769 treesize of output 761 [2023-09-04 21:30:39,823 INFO L351 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 479 treesize of output 415 [2023-09-04 21:30:39,849 INFO L351 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 548 treesize of output 476 [2023-09-04 21:30:39,875 INFO L351 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 276 treesize of output 260 [2023-09-04 21:30:39,898 INFO L351 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 110 treesize of output 94 [2023-09-04 21:30:40,032 INFO L351 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 16 treesize of output 8 [2023-09-04 21:30:40,181 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:40,182 INFO L351 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 296 treesize of output 260 [2023-09-04 21:30:42,107 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:42,107 INFO L351 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 44 treesize of output 114 [2023-09-04 21:30:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-09-04 21:30:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128223330] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-04 21:30:42,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-04 21:30:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 33, 35] total 107 [2023-09-04 21:30:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356138750] [2023-09-04 21:30:42,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-04 21:30:42,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2023-09-04 21:30:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2023-09-04 21:30:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=8232, Unknown=73, NotChecked=2364, Total=11342 [2023-09-04 21:30:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:42,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:42,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 4.88785046728972) internal successors, (523), 107 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:42,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:49,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:30:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:30:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-09-04 21:30:57,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-04 21:30:57,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-09-04 21:30:57,741 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)] === [2023-09-04 21:30:57,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash -644274329, now seen corresponding path program 1 times [2023-09-04 21:30:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46100246] [2023-09-04 21:30:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:31:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-09-04 21:31:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:31:00,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46100246] [2023-09-04 21:31:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46100246] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:31:00,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:31:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-09-04 21:31:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875385138] [2023-09-04 21:31:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:31:00,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-04 21:31:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:31:00,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-04 21:31:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2023-09-04 21:31:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:00,404 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:31:00,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.433333333333334) internal successors, (193), 30 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-09-04 21:31:00,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:31:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:31:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-04 21:31:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-09-04 21:31:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-04 21:31:07,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-04 21:31:07,100 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)] === [2023-09-04 21:31:07,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:31:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1705847134, now seen corresponding path program 1 times [2023-09-04 21:31:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:31:07,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888007146] [2023-09-04 21:31:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:31:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:31:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:31:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-04 21:31:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:31:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888007146] [2023-09-04 21:31:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888007146] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 21:31:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399907557] [2023-09-04 21:31:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:31:13,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 21:31:13,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:31:13,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 21:31:13,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-04 21:31:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:31:13,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 132 conjunts are in the unsatisfiable core [2023-09-04 21:31:13,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 21:31:14,095 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-04 21:31:14,096 INFO L351 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 17 treesize of output 21 [2023-09-04 21:31:14,167 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-04 21:31:14,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-04 21:31:14,431 INFO L351 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 11 treesize of output 7 [2023-09-04 21:31:14,524 INFO L351 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 [2023-09-04 21:31:15,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-04 21:31:15,331 INFO L351 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 21 treesize of output 21 [2023-09-04 21:31:15,961 INFO L351 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 [2023-09-04 21:31:16,095 INFO L351 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 33 treesize of output 38 [2023-09-04 21:31:16,397 INFO L351 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 33 treesize of output 31 [2023-09-04 21:31:16,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:16,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-09-04 21:31:17,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:17,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-04 21:31:17,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:17,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-04 21:31:17,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:17,772 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2023-09-04 21:31:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:17,961 INFO L351 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 30 treesize of output 35 [2023-09-04 21:31:18,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:18,818 INFO L351 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 32 treesize of output 28 [2023-09-04 21:31:18,829 INFO L351 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 20 treesize of output 14 [2023-09-04 21:31:18,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:18,943 INFO L351 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 14 treesize of output 16 [2023-09-04 21:31:19,127 INFO L351 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 [2023-09-04 21:31:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-09-04 21:31:19,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 21:31:19,391 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse1) 1)))) (or .cse0 (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-09-04 21:31:19,489 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0)) (.cse0 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse0) 1))) (not .cse1)) (or .cse1 (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse0) 0)))))) is different from false [2023-09-04 21:32:46,148 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse20 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse20 .cse12) 4)) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ 1 (select .cse10 .cse12)))) (and (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_575) .cse12 .cse13)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) 0))))) (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int)) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_575) .cse12 .cse13)))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|))) 0)))))))) is different from false [2023-09-04 21:33:51,299 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int) (|t1Thread1of1ForFork0_~value~0#1| Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse10 .cse8 v_ArrVal_575) .cse7 (+ (select .cse10 .cse7) 1)))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse7))) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= 0 (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int) (|t1Thread1of1ForFork0_~value~0#1| Int)) (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse18 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse19 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse19 .cse8 v_ArrVal_575) .cse7 (+ (select .cse19 .cse7) 1)))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* 4 (select .cse17 .cse7))) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (= 0 (let ((.cse13 (select .cse14 |c_~#queue~0.base|))) (select .cse13 (+ (* 4 (select .cse13 .cse2)) |c_~#queue~0.offset|)))) (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))))))) is different from false [2023-09-04 21:33:52,276 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_572))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_575) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0)))) (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_572))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_575) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)))) 0))))))) is different from false [2023-09-04 21:33:52,862 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int) (v_ArrVal_571 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_572))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_575) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0))))) (forall ((v_ArrVal_588 Int) (v_ArrVal_575 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int) (v_ArrVal_571 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_572 (Array Int Int))) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_572))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_575) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) v_ArrVal_581)) .cse8 v_ArrVal_583) .cse7 v_ArrVal_586))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_588))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)))) 0)))))) is different from false Received shutdown request... [2023-09-04 21:34:21,969 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2023-09-04 21:34:21,969 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 21:34:21,990 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 21:34:22,851 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-09-04 21:34:22,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-04 21:34:22,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-04 21:34:22,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-09-04 21:34:23,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-09-04 21:34:23,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 21:34:23,054 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 0ms.. [2023-09-04 21:34:23,055 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-04 21:34:23,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-04 21:34:23,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-04 21:34:23,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-09-04 21:34:23,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-09-04 21:34:23,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-04 21:34:23,059 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-04 21:34:23,062 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-04 21:34:23,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-04 21:34:23,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:34:23 BasicIcfg [2023-09-04 21:34:23,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-04 21:34:23,064 INFO L158 Benchmark]: Toolchain (without parser) took 248828.35ms. Allocated memory was 245.4MB in the beginning and 647.0MB in the end (delta: 401.6MB). Free memory was 193.7MB in the beginning and 555.9MB in the end (delta: -362.3MB). Peak memory consumption was 390.6MB. Max. memory is 7.0GB. [2023-09-04 21:34:23,064 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-04 21:34:23,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.13ms. Allocated memory is still 245.4MB. Free memory was 193.1MB in the beginning and 163.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 7.0GB. [2023-09-04 21:34:23,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.82ms. Allocated memory is still 245.4MB. Free memory was 162.7MB in the beginning and 160.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-04 21:34:23,065 INFO L158 Benchmark]: Boogie Preprocessor took 51.56ms. Allocated memory is still 245.4MB. Free memory was 160.1MB in the beginning and 157.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-04 21:34:23,065 INFO L158 Benchmark]: RCFGBuilder took 609.53ms. Allocated memory is still 245.4MB. Free memory was 157.5MB in the beginning and 134.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 7.0GB. [2023-09-04 21:34:23,065 INFO L158 Benchmark]: TraceAbstraction took 247525.44ms. Allocated memory was 245.4MB in the beginning and 647.0MB in the end (delta: 401.6MB). Free memory was 133.9MB in the beginning and 555.9MB in the end (delta: -422.0MB). Peak memory consumption was 330.8MB. Max. memory is 7.0GB. [2023-09-04 21:34:23,066 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.14ms. Allocated memory is still 180.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 579.13ms. Allocated memory is still 245.4MB. Free memory was 193.1MB in the beginning and 163.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 55.82ms. Allocated memory is still 245.4MB. Free memory was 162.7MB in the beginning and 160.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 51.56ms. Allocated memory is still 245.4MB. Free memory was 160.1MB in the beginning and 157.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * RCFGBuilder took 609.53ms. Allocated memory is still 245.4MB. Free memory was 157.5MB in the beginning and 134.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 7.0GB. * TraceAbstraction took 247525.44ms. Allocated memory was 245.4MB in the beginning and 647.0MB in the end (delta: 401.6MB). Free memory was 133.9MB in the beginning and 555.9MB in the end (delta: -422.0MB). Peak memory consumption was 330.8MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 289, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 246, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 256, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 256, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 256, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 246, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 246, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 256, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 246, unknown conditional: 0, unknown unconditional: 246] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 244, Positive conditional cache size: 0, Positive unconditional cache size: 244, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 43 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 11 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 0ms.. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 0ms.. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 0ms.. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 0ms.. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 89 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 247.3s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 26.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 1603 NumberOfCodeBlocks, 1603 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1786 ConstructedInterpolants, 118 QuantifiedInterpolants, 34480 SizeOfPredicates, 35 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 335/352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown