/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 17:58:40,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 17:58:41,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-07 17:58:41,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 17:58:41,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 17:58:41,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 17:58:41,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 17:58:41,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 17:58:41,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 17:58:41,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 17:58:41,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 17:58:41,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 17:58:41,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 17:58:41,066 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 17:58:41,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 17:58:41,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 17:58:41,067 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 17:58:41,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 17:58:41,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 17:58:41,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 17:58:41,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 17:58:41,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 17:58:41,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 17:58:41,068 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 17:58:41,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 17:58:41,069 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 17:58:41,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 17:58:41,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 17:58:41,070 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 17:58:41,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 17:58:41,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 17:58:41,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 17:58:41,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 17:58:41,071 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-07 17:58:41,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 17:58:41,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 17:58:41,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 17:58:41,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 17:58:41,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 17:58:41,072 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 17:58:41,072 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-07 17:58:41,073 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR [2023-09-07 17:58:41,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 17:58:41,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 17:58:41,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 17:58:41,327 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 17:58:41,327 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 17:58:41,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-09-07 17:58:42,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 17:58:42,722 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 17:58:42,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-09-07 17:58:42,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0b815f4/38ec058509464bbab15147eb17a046e9/FLAGe0a93d1be [2023-09-07 17:58:42,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0b815f4/38ec058509464bbab15147eb17a046e9 [2023-09-07 17:58:42,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 17:58:42,756 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 17:58:42,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 17:58:42,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 17:58:42,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 17:58:42,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 05:58:42" (1/1) ... [2023-09-07 17:58:42,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155a0e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:42, skipping insertion in model container [2023-09-07 17:58:42,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 05:58:42" (1/1) ... [2023-09-07 17:58:42,831 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 17:58:43,197 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_ok.i[43266,43279] [2023-09-07 17:58:43,201 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_ok.i[43543,43556] [2023-09-07 17:58:43,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 17:58:43,216 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 17:58:43,241 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-07 17:58:43,243 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-07 17:58:43,258 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-07 17:58:43,273 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_ok.i[43266,43279] [2023-09-07 17:58:43,275 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_ok.i[43543,43556] [2023-09-07 17:58:43,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 17:58:43,335 INFO L206 MainTranslator]: Completed translation [2023-09-07 17:58:43,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43 WrapperNode [2023-09-07 17:58:43,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 17:58:43,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 17:58:43,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 17:58:43,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 17:58:43,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,407 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-09-07 17:58:43,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 17:58:43,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 17:58:43,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 17:58:43,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 17:58:43,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 17:58:43,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 17:58:43,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 17:58:43,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 17:58:43,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (1/1) ... [2023-09-07 17:58:43,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 17:58:43,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:58:43,493 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-07 17:58:43,506 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-07 17:58:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-07 17:58:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-07 17:58:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-07 17:58:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-07 17:58:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 17:58:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 17:58:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 17:58:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 17:58:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-07 17:58:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 17:58:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 17:58:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 17:58:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 17:58:43,535 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 17:58:43,678 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 17:58:43,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 17:58:43,976 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 17:58:43,984 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 17:58:43,984 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-07 17:58:43,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 05:58:43 BoogieIcfgContainer [2023-09-07 17:58:43,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 17:58:43,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 17:58:43,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 17:58:43,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 17:58:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 05:58:42" (1/3) ... [2023-09-07 17:58:43,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7c8634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 05:58:43, skipping insertion in model container [2023-09-07 17:58:43,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 05:58:43" (2/3) ... [2023-09-07 17:58:43,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7c8634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 05:58:43, skipping insertion in model container [2023-09-07 17:58:43,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 05:58:43" (3/3) ... [2023-09-07 17:58:43,992 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-09-07 17:58:43,999 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 17:58:44,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 17:58:44,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-07 17:58:44,008 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 17:58:44,139 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-07 17:58:44,183 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:58:44,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 17:58:44,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:58:44,184 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-07 17:58:44,186 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-07 17:58:44,220 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-07 17:58:44,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-07 17:58:44,232 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;@10365fd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 17:58:44,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-07 17:58:44,253 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 2 more)] === [2023-09-07 17:58:44,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:44,258 INFO L85 PathProgramCache]: Analyzing trace with hash -783037911, now seen corresponding path program 1 times [2023-09-07 17:58:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:44,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979912315] [2023-09-07 17:58:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:44,508 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-07 17:58:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979912315] [2023-09-07 17:58:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979912315] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:58:44,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:58:44,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 17:58:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863535793] [2023-09-07 17:58:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:58:44,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-07 17:58:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-07 17:58:44,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-07 17:58:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:44,543 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:44,543 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-07 17:58:44,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:44,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 17:58:44,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:58:44,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash -446658237, now seen corresponding path program 1 times [2023-09-07 17:58:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204609669] [2023-09-07 17:58:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:44,931 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-07 17:58:44,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204609669] [2023-09-07 17:58:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204609669] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:58:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:58:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-07 17:58:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208296947] [2023-09-07 17:58:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:58:44,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-07 17:58:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-07 17:58:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-07 17:58:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:44,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:44,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 17:58:44,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:44,936 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 [2023-09-07 17:58:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:45,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:45,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-07 17:58:45,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:58:45,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1277973936, now seen corresponding path program 1 times [2023-09-07 17:58:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309388459] [2023-09-07 17:58:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:45,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:45,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309388459] [2023-09-07 17:58:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309388459] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:58:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185957223] [2023-09-07 17:58:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:45,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:45,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:58:45,431 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-07 17:58:45,432 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-07 17:58:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:45,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-07 17:58:45,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:58:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:45,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:58:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185957223] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:58:45,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:58:45,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-09-07 17:58:45,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026363968] [2023-09-07 17:58:45,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:58:45,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-07 17:58:45,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:45,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-07 17:58:45,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-09-07 17:58:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:45,785 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:45,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 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-07 17:58:45,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:45,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:45,786 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 [2023-09-07 17:58:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:46,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-07 17:58:46,198 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,SelfDestructingSolverStorable2 [2023-09-07 17:58:46,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:58:46,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1525400594, now seen corresponding path program 2 times [2023-09-07 17:58:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477540328] [2023-09-07 17:58:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-09-07 17:58:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477540328] [2023-09-07 17:58:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477540328] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:58:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 17:58:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-07 17:58:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497133182] [2023-09-07 17:58:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:58:46,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-07 17:58:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-07 17:58:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-07 17:58:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:46,415 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-07 17:58:46,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:46,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:46,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:46,415 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 [2023-09-07 17:58:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:46,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-07 17:58:46,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:58:46,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash 525238176, now seen corresponding path program 1 times [2023-09-07 17:58:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876092209] [2023-09-07 17:58:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:47,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876092209] [2023-09-07 17:58:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876092209] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:58:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197103433] [2023-09-07 17:58:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:47,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:58:47,015 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-07 17:58:47,017 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-07 17:58:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:47,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-07 17:58:47,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:58:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:47,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:58:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197103433] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:58:47,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:58:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-09-07 17:58:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762487192] [2023-09-07 17:58:47,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:58:47,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-09-07 17:58:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-09-07 17:58:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-09-07 17:58:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:47,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:47,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 17.954545454545453) internal successors, (395), 22 states have internal predecessors, (395), 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-07 17:58:47,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:47,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:47,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:47,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:47,668 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 [2023-09-07 17:58:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:58:48,190 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-07 17:58:48,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:48,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:58:48,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash 978689628, now seen corresponding path program 2 times [2023-09-07 17:58:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448181756] [2023-09-07 17:58:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:49,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448181756] [2023-09-07 17:58:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448181756] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:58:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916568327] [2023-09-07 17:58:49,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 17:58:49,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:49,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:58:49,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:58:49,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-07 17:58:49,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-07 17:58:49,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:58:49,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-07 17:58:49,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:58:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1360 trivial. 0 not checked. [2023-09-07 17:58:49,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-07 17:58:49,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916568327] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:58:49,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-07 17:58:49,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [23] total 25 [2023-09-07 17:58:49,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614024466] [2023-09-07 17:58:49,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:58:49,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-07 17:58:49,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:49,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-07 17:58:49,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-09-07 17:58:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:49,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:49,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-07 17:58:49,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:49,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:49,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:49,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:49,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:58:49,704 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 [2023-09-07 17:58:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:58:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:58:50,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-07 17:58:50,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:50,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:58:50,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1290472203, now seen corresponding path program 1 times [2023-09-07 17:58:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:50,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970233520] [2023-09-07 17:58:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:50,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970233520] [2023-09-07 17:58:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970233520] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:58:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706885376] [2023-09-07 17:58:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:51,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:51,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:58:51,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:58:51,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-07 17:58:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:51,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 22 conjunts are in the unsatisfiable core [2023-09-07 17:58:51,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:58:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:51,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:58:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 0 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706885376] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:58:52,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:58:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 43 [2023-09-07 17:58:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887079617] [2023-09-07 17:58:52,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:58:52,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-07 17:58:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:52,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-07 17:58:52,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-09-07 17:58:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:52,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:52,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 16.837209302325583) internal successors, (724), 43 states have internal predecessors, (724), 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-07 17:58:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:58:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:58:52,643 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 [2023-09-07 17:58:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:58:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:58:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:58:54,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-07 17:58:54,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:54,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:58:54,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:58:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1666013731, now seen corresponding path program 2 times [2023-09-07 17:58:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:58:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293120863] [2023-09-07 17:58:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:58:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:58:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:58:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6321 backedges. 5769 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:58:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293120863] [2023-09-07 17:58:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293120863] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:58:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521833441] [2023-09-07 17:58:57,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 17:58:57,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:58:57,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:58:57,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:58:57,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-07 17:58:57,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 17:58:57,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:58:57,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 42 conjunts are in the unsatisfiable core [2023-09-07 17:58:57,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:58:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6321 backedges. 6321 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 17:58:58,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-07 17:58:58,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521833441] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 17:58:58,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-07 17:58:58,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2023-09-07 17:58:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216607388] [2023-09-07 17:58:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 17:58:58,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-07 17:58:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:58:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-07 17:58:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2023-09-07 17:58:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:58,283 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:58:58,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 17.488372093023255) internal successors, (752), 43 states have internal predecessors, (752), 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-07 17:58:58,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:58,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:58,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:58,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:58,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:58:58,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:58:58,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:58:58,285 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 [2023-09-07 17:58:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:58:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:58:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:58:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:58:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:58:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:58:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:58:59,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-07 17:59:00,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:59:00,117 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:59:00,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:59:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1321391507, now seen corresponding path program 1 times [2023-09-07 17:59:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:59:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976923771] [2023-09-07 17:59:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:59:00,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:59:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:59:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5731 backedges. 1400 proven. 37 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2023-09-07 17:59:05,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:59:05,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976923771] [2023-09-07 17:59:05,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976923771] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:59:05,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340803312] [2023-09-07 17:59:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:59:05,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:59:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:59:05,913 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:59:05,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-07 17:59:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:59:06,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 32 conjunts are in the unsatisfiable core [2023-09-07 17:59:06,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:59:07,713 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-07 17:59:07,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:07,776 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-07 17:59:07,920 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-07 17:59:07,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2023-09-07 17:59:07,946 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-07 17:59:07,958 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-07 17:59:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5731 backedges. 3096 proven. 181 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2023-09-07 17:59:07,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:59:08,189 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1485 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1485) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2023-09-07 17:59:08,231 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:08,231 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-09-07 17:59:08,242 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:08,243 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 35 treesize of output 34 [2023-09-07 17:59:08,268 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 7 treesize of output 3 [2023-09-07 17:59:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5731 backedges. 3061 proven. 181 refuted. 0 times theorem prover too weak. 2454 trivial. 35 not checked. [2023-09-07 17:59:08,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340803312] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:59:08,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:59:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 38 [2023-09-07 17:59:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504328172] [2023-09-07 17:59:08,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:59:08,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-09-07 17:59:08,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:59:08,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-09-07 17:59:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1169, Unknown=1, NotChecked=70, Total=1406 [2023-09-07 17:59:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:08,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:59:08,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 12.842105263157896) internal successors, (488), 38 states have internal predecessors, (488), 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-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:59:08,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:59:08,710 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 [2023-09-07 17:59:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:59:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:59:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:59:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:59:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:59:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-07 17:59:10,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-07 17:59:10,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:59:10,288 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:59:10,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:59:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1818231711, now seen corresponding path program 1 times [2023-09-07 17:59:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:59:10,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499222816] [2023-09-07 17:59:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:59:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:59:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:59:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5711 backedges. 171 proven. 3051 refuted. 0 times theorem prover too weak. 2489 trivial. 0 not checked. [2023-09-07 17:59:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:59:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499222816] [2023-09-07 17:59:20,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499222816] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:59:20,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199596838] [2023-09-07 17:59:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:59:20,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:59:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:59:20,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:59:20,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-07 17:59:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:59:20,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 1650 conjuncts, 35 conjunts are in the unsatisfiable core [2023-09-07 17:59:20,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:59:22,761 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 26 treesize of output 10 [2023-09-07 17:59:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5711 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 5643 trivial. 0 not checked. [2023-09-07 17:59:22,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:59:22,994 INFO L322 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2023-09-07 17:59:22,995 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 41 [2023-09-07 17:59:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5711 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2023-09-07 17:59:23,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199596838] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:59:23,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:59:23,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13, 11] total 45 [2023-09-07 17:59:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159413828] [2023-09-07 17:59:23,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:59:23,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-09-07 17:59:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:59:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-09-07 17:59:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1724, Unknown=0, NotChecked=0, Total=1980 [2023-09-07 17:59:23,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:23,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:59:23,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 11.2) internal successors, (504), 45 states have internal predecessors, (504), 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-07 17:59:23,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:59:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-07 17:59:23,109 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 [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:59:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-07 17:59:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-07 17:59:24,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-07 17:59:24,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-09-07 17:59:24,965 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:59:24,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:59:24,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1231800167, now seen corresponding path program 1 times [2023-09-07 17:59:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:59:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190143984] [2023-09-07 17:59:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:59:24,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:59:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:59:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 1409 proven. 42 refuted. 0 times theorem prover too weak. 4249 trivial. 0 not checked. [2023-09-07 17:59:29,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:59:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190143984] [2023-09-07 17:59:29,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190143984] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:59:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206086345] [2023-09-07 17:59:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:59:29,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:59:29,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:59:29,555 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:59:29,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-07 17:59:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:59:29,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 82 conjunts are in the unsatisfiable core [2023-09-07 17:59:29,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:59:30,623 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-07 17:59:30,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:30,691 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-07 17:59:30,910 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-07 17:59:30,952 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-07 17:59:31,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-07 17:59:31,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:31,145 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-07 17:59:31,365 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-07 17:59:31,402 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-07 17:59:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2332 proven. 29 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2023-09-07 17:59:31,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:59:31,719 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-07 17:59:31,725 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-07 17:59:31,729 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2251 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1))))) is different from false [2023-09-07 17:59:31,750 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-07 17:59:31,778 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2245 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (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_2245)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-07 17:59:31,788 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2245 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2245)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-07 17:59:31,801 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2253 Int) (v_ArrVal_2245 Int) (v_ArrVal_2247 Int) (v_ArrVal_2251 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2245)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2247) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2251) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2253)) .cse1)) 20))) is different from false [2023-09-07 17:59:32,276 INFO L322 Elim1Store]: treesize reduction 335, result has 45.1 percent of original size [2023-09-07 17:59:32,276 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 457 treesize of output 530 [2023-09-07 17:59:32,358 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-09-07 17:59:32,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 407 treesize of output 630 [2023-09-07 17:59:32,379 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 111 treesize of output 87 [2023-09-07 17:59:33,134 INFO L322 Elim1Store]: treesize reduction 131, result has 33.8 percent of original size [2023-09-07 17:59:33,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 576 treesize of output 2454 [2023-09-07 17:59:33,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 49 treesize of output 33 [2023-09-07 17:59:33,752 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 8 treesize of output 4 [2023-09-07 17:59:33,942 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 8 treesize of output 4 [2023-09-07 17:59:33,983 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:33,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 117 [2023-09-07 17:59:34,520 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:34,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 87 [2023-09-07 17:59:34,870 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:34,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 394 treesize of output 395 [2023-09-07 17:59:35,468 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-07 17:59:35,469 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 391 treesize of output 343 [2023-09-07 17:59:35,479 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 113 treesize of output 109 [2023-09-07 17:59:35,516 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:35,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 83 [2023-09-07 17:59:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 2221 proven. 75 refuted. 5 times theorem prover too weak. 3339 trivial. 60 not checked. [2023-09-07 17:59:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206086345] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:59:35,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:59:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 21] total 53 [2023-09-07 17:59:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777390021] [2023-09-07 17:59:35,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:59:35,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-09-07 17:59:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:59:35,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-09-07 17:59:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1693, Unknown=12, NotChecked=658, Total=2756 [2023-09-07 17:59:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:35,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:59:35,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 11.056603773584905) internal successors, (586), 53 states have internal predecessors, (586), 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-07 17:59:35,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:35,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:35,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:59:35,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:35,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:59:35,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:59:35,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:59:35,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:59:35,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-07 17:59:35,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-09-07 17:59:35,812 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 [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:59:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-07 17:59:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-07 17:59:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-07 17:59:38,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-07 17:59:38,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:59:38,566 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 17:59:38,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 17:59:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash -590754094, now seen corresponding path program 2 times [2023-09-07 17:59:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 17:59:38,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690585108] [2023-09-07 17:59:38,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 17:59:38,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 17:59:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 17:59:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3719 proven. 200 refuted. 0 times theorem prover too weak. 2071 trivial. 0 not checked. [2023-09-07 17:59:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 17:59:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690585108] [2023-09-07 17:59:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690585108] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 17:59:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26060601] [2023-09-07 17:59:45,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 17:59:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 17:59:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 17:59:45,985 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 17:59:45,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-07 17:59:46,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 17:59:46,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 17:59:46,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 130 conjunts are in the unsatisfiable core [2023-09-07 17:59:46,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 17:59:47,896 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-07 17:59:47,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:47,941 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-07 17:59:48,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:48,148 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 20 [2023-09-07 17:59:48,185 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-07 17:59:48,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-07 17:59:48,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:48,373 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-07 17:59:48,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:48,565 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 20 [2023-09-07 17:59:48,611 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-07 17:59:48,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-07 17:59:48,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:48,861 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-07 17:59:49,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:49,062 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 20 [2023-09-07 17:59:49,105 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-07 17:59:49,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-09-07 17:59:49,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-07 17:59:49,401 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-07 17:59:49,601 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-07 17:59:49,635 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-07 17:59:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3933 proven. 411 refuted. 0 times theorem prover too weak. 1646 trivial. 0 not checked. [2023-09-07 17:59:49,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 17:59:49,862 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1)) 20))) is different from false [2023-09-07 17:59:49,883 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1)) 20))) is different from false [2023-09-07 17:59:49,948 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1))))) is different from false [2023-09-07 17:59:50,063 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2655) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2659)) .cse1)) 20))) (= .cse4 20)))) is different from false [2023-09-07 17:59:50,085 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse2 (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_2653)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2655) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1)) 20)) (= .cse4 20))))) is different from false [2023-09-07 17:59:50,098 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse5 (select .cse4 .cse1))) (or (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2655) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3)) 20)) (= .cse5 20)))))))) is different from false [2023-09-07 17:59:50,130 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 20 .cse0) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2655) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2659)) .cse2)) 20)) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|)))))) is different from false [2023-09-07 17:59:50,549 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse5 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (= 20 .cse2) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2655) .cse1 (+ 1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1) 20)))))))) is different from false [2023-09-07 17:59:50,566 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2655) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1))) (= 20 .cse5))))))) is different from false [2023-09-07 17:59:51,414 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2646)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse5 (select .cse9 .cse2))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2648) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse8 .cse4))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (= .cse5 20) (not (= (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2655) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse4) 20))))))))))) is different from false [2023-09-07 17:59:52,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse1))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_2648) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2655) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (= .cse5 20) (= 20 .cse7) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|))))))))))) is different from false [2023-09-07 17:59:52,280 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse10 .cse3))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2648) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse0 (select .cse6 .cse3))) (or (= .cse0 20) (= .cse1 20) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2655) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20)) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|))))))))))) is different from false [2023-09-07 17:59:52,657 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2639 Int) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2640 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (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_2639)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2640) .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse10 .cse2))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_2648) .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse0 (select .cse7 .cse2))) (or (= 20 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2655) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2659)) .cse2) 20)))))))))))) is different from false [2023-09-07 17:59:53,172 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2639 Int) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2640 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2639))) (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2640) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select .cse12 .cse3))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2648) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse9 (select .cse7 .cse3))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2655) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20)) (= .cse9 20) (= .cse10 20)))))))))))) is different from false [2023-09-07 17:59:53,999 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:54,000 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 1 case distinctions, treesize of input 2550 treesize of output 1770 [2023-09-07 17:59:54,031 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:54,032 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 2418 treesize of output 2380 [2023-09-07 17:59:54,050 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 367 treesize of output 355 [2023-09-07 17:59:54,063 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 38 treesize of output 30 [2023-09-07 17:59:54,075 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 38 treesize of output 30 [2023-09-07 17:59:54,088 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 13 treesize of output 9 [2023-09-07 17:59:54,123 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 8 treesize of output 4 [2023-09-07 17:59:54,171 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 17:59:54,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 471 treesize of output 443 [2023-09-07 17:59:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5990 backedges. 3341 proven. 580 refuted. 24 times theorem prover too weak. 1667 trivial. 378 not checked. [2023-09-07 17:59:55,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26060601] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 17:59:55,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 17:59:55,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 44] total 104 [2023-09-07 17:59:55,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116267753] [2023-09-07 17:59:55,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 17:59:55,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-09-07 17:59:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 17:59:55,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-09-07 17:59:55,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1298, Invalid=6595, Unknown=173, NotChecked=2646, Total=10712 [2023-09-07 17:59:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:55,580 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 17:59:55,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.9423076923076925) internal successors, (826), 104 states have internal predecessors, (826), 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-07 17:59:55,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 17:59:55,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:55,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-07 17:59:55,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer [2023-09-07 18:00:28,187 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (select .cse17 .cse16))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse51 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse17 .cse16 (+ .cse18 1)))) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse29 (= .cse18 20)) (.cse7 (select .cse8 .cse3)) (.cse35 (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse54 (store .cse51 |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse52 (select .cse54 |c_~#queue~0.base|))) (let ((.cse55 (store .cse52 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse56 (select .cse55 .cse3))) (or (< (select .cse52 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= 20 (select (let ((.cse53 (select (store (store .cse54 |c_~#queue~0.base| (store (store .cse55 .cse5 v_ArrVal_2655) .cse3 (+ .cse56 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse53 (+ (* 4 (select .cse53 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3))) (= 20 .cse56)))))))) (.cse28 (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= 20 (select (let ((.cse50 (select (store .cse51 |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse50 (+ (* (select .cse50 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3))))) (.cse43 (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20))) (and (<= |c_~#stored_elements~0.base| 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (forall ((v_ArrVal_2659 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (select (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2659)) .cse1))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| 5) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse6 (select .cse4 .cse3))) (or (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2655) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2659)) .cse3) 20)) (= .cse6 20) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int)) (or (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse15 (store .cse17 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2646))) (let ((.cse10 (select .cse15 .cse16))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse15 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2648) .cse16 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|))) (let ((.cse14 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse9 (select .cse14 .cse3))) (or (= 20 .cse9) (= .cse10 20) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= (select (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_2655) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20)))))))))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|))) (= 5 |c_~#queue~0.base|) (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2644 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse26 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2644))) (let ((.cse23 (select .cse26 |c_~#queue~0.base|))) (let ((.cse27 (store .cse23 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646))) (let ((.cse25 (select .cse27 .cse3))) (let ((.cse20 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse5 v_ArrVal_2648) .cse3 (+ .cse25 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse24 (select .cse20 |c_~#queue~0.base|))) (let ((.cse21 (store .cse24 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse22 (select .cse21 .cse3))) (or (not (= (select (let ((.cse19 (select (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse5 v_ArrVal_2655) .cse3 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20)) (< (select .cse23 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (< (select .cse24 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (= 20 .cse22) (= 20 .cse25))))))))))) (or .cse28 .cse29) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse32 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse34 (select .cse32 |c_~#queue~0.base|))) (let ((.cse33 (store .cse34 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse30 (select .cse33 .cse3))) (or (= .cse30 20) (not (= 20 (select (let ((.cse31 (select (store (store .cse32 |c_~#queue~0.base| (store (store .cse33 .cse5 v_ArrVal_2655) .cse3 (+ .cse30 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse31 (+ |c_~#queue~0.offset| (* 4 (select .cse31 .cse3))) v_ArrVal_2659)) .cse3))) (< (select .cse34 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|))))))) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (or .cse35 .cse29) (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2646 Int) (v_ArrVal_2648 Int) (v_ArrVal_2659 Int)) (let ((.cse42 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2646))) (let ((.cse41 (select .cse42 .cse3))) (let ((.cse39 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse42 .cse5 v_ArrVal_2648) .cse3 (+ .cse41 1))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse37 (select .cse39 |c_~#queue~0.base|))) (let ((.cse40 (store .cse37 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse36 (select .cse40 .cse3))) (or (= .cse36 20) (< (select .cse37 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206|) (not (= 20 (select (let ((.cse38 (select (store (store .cse39 |c_~#queue~0.base| (store (store .cse40 .cse5 v_ArrVal_2655) .cse3 (+ .cse36 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3))) (= .cse41 20))))))))) (forall ((v_ArrVal_2659 Int)) (not (= (select (store .cse8 (+ (* .cse7 4) |c_~#queue~0.offset|) v_ArrVal_2659) .cse3) 20))) (or .cse35 .cse43) (forall ((v_ArrVal_2659 Int)) (not (= (select (store .cse17 (+ (* .cse18 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2659) .cse16) 20))) (not (= (select .cse17 84) 20)) (forall ((v_ArrVal_2658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| Int) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2653 Int) (v_ArrVal_2655 Int) (v_ArrVal_2659 Int)) (let ((.cse46 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse17 .cse16 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2651))) (let ((.cse44 (select .cse46 |c_~#queue~0.base|))) (let ((.cse47 (store .cse44 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203| 4)) v_ArrVal_2653))) (let ((.cse48 (select .cse47 .cse3))) (or (< (select .cse44 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_203|) (not (= (select (let ((.cse45 (select (store (store .cse46 |c_~#queue~0.base| (store (store .cse47 .cse5 v_ArrVal_2655) .cse3 (+ .cse48 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse45 (+ (* (select .cse45 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20)) (= .cse48 20))))))) (forall ((v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2659 Int)) (not (= (select (let ((.cse49 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse17 .cse16 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2658) |c_~#queue~0.base|))) (store .cse49 (+ (* (select .cse49 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2659)) .cse3) 20))) (or .cse28 .cse43)))))) is different from false 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-07 18:00:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 18:00:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 18:00:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-07 18:00:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-07 18:00:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-09-07 18:00:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-07 18:00:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-09-07 18:00:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-07 18:00:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-07 18:00:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-07 18:00:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-07 18:00:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-09-07 18:00:36,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-09-07 18:00:36,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-09-07 18:00:36,676 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-07 18:00:36,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 18:00:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash 910595484, now seen corresponding path program 3 times [2023-09-07 18:00:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 18:00:36,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952704224] [2023-09-07 18:00:36,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 18:00:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 18:00:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 18:00:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 4151 proven. 924 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2023-09-07 18:00:52,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 18:00:52,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952704224] [2023-09-07 18:00:52,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952704224] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 18:00:52,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178594491] [2023-09-07 18:00:52,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-07 18:00:52,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 18:00:52,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 18:00:52,949 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 18:00:52,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process Received shutdown request... [2023-09-07 18:12:35,903 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-07 18:12:35,903 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-07 18:12:35,904 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 18:12:36,936 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-07 18:12:37,100 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-07 18:12:37,116 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forcibly destroying the process [2023-09-07 18:12:37,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 137 [2023-09-07 18:12:37,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-09-07 18:12:37,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-09-07 18:12:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2023-09-07 18:12:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458632052] [2023-09-07 18:12:37,141 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-09-07 18:12:37,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-09-07 18:12:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 18:12:37,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-09-07 18:12:37,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2023-09-07 18:12:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 18:12:37,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 18:12:37,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 8.851851851851851) internal successors, (478), 54 states have internal predecessors, (478), 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-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-09-07 18:12:37,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 18:12:37,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-07 18:12:37,146 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2023-09-07 18:12:37,147 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-07 18:12:37,148 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-07 18:12:37,148 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-07 18:12:37,148 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-09-07 18:12:37,148 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-07 18:12:37,153 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2023-09-07 18:12:37,157 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-07 18:12:37,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-07 18:12:37,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:12:37 BasicIcfg [2023-09-07 18:12:37,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-07 18:12:37,159 INFO L158 Benchmark]: Toolchain (without parser) took 834403.02ms. Allocated memory was 259.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 209.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 320.0MB. Max. memory is 7.0GB. [2023-09-07 18:12:37,159 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 18:12:37,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.84ms. Allocated memory is still 259.0MB. Free memory was 209.9MB in the beginning and 179.5MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. [2023-09-07 18:12:37,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.13ms. Allocated memory is still 259.0MB. Free memory was 179.5MB in the beginning and 176.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-07 18:12:37,160 INFO L158 Benchmark]: Boogie Preprocessor took 53.68ms. Allocated memory is still 259.0MB. Free memory was 176.8MB in the beginning and 174.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 18:12:37,160 INFO L158 Benchmark]: RCFGBuilder took 523.07ms. Allocated memory is still 259.0MB. Free memory was 174.7MB in the beginning and 226.0MB in the end (delta: -51.3MB). Peak memory consumption was 24.1MB. Max. memory is 7.0GB. [2023-09-07 18:12:37,160 INFO L158 Benchmark]: TraceAbstraction took 833171.42ms. Allocated memory was 259.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 225.5MB in the beginning and 1.2GB in the end (delta: -999.1MB). Peak memory consumption was 334.7MB. Max. memory is 7.0GB. [2023-09-07 18:12:37,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 579.84ms. Allocated memory is still 259.0MB. Free memory was 209.9MB in the beginning and 179.5MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 70.13ms. Allocated memory is still 259.0MB. Free memory was 179.5MB in the beginning and 176.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 53.68ms. Allocated memory is still 259.0MB. Free memory was 176.8MB in the beginning and 174.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 523.07ms. Allocated memory is still 259.0MB. Free memory was 174.7MB in the beginning and 226.0MB in the end (delta: -51.3MB). Peak memory consumption was 24.1MB. Max. memory is 7.0GB. * TraceAbstraction took 833171.42ms. Allocated memory was 259.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 225.5MB in the beginning and 1.2GB in the end (delta: -999.1MB). Peak memory consumption was 334.7MB. 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: 5949, independent: 5843, independent conditional: 5843, independent unconditional: 0, dependent: 106, dependent conditional: 106, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5854, independent: 5843, independent conditional: 5843, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5854, independent: 5843, independent conditional: 5843, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5931, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 88, dependent conditional: 77, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5931, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5931, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5854, independent: 5843, independent conditional: 0, independent unconditional: 5843, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5854, independent: 5834, independent conditional: 0, independent unconditional: 5834, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5931, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 5854, unknown conditional: 0, unknown unconditional: 5854] , Statistics on independence cache: Total cache size (in pairs): 5854, Positive cache size: 5843, Positive conditional cache size: 0, Positive unconditional cache size: 5843, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 77, Maximal queried relation: 12, Independence queries for same thread: 95 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 50, RedundantProofs: 13, ProvenStates: 116 - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DynamicStratifiedReduction. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 833.0s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 51.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: 303, 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.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 71.0s InterpolantComputationTime, 11310 NumberOfCodeBlocks, 11010 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 15164 ConstructedInterpolants, 182 QuantifiedInterpolants, 124863 SizeOfPredicates, 161 NumberOfNonLiveVariables, 10307 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 82967/95739 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