/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-fffa3fa-m [2023-09-04 21:30:12,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-04 21:30:12,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-04 21:30:12,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-04 21:30:12,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-04 21:30:12,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-04 21:30:12,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-04 21:30:12,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-04 21:30:12,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-04 21:30:12,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-04 21:30:12,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-04 21:30:12,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-04 21:30:12,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-04 21:30:12,860 INFO L153 SettingsManager]: * Use SBE=true [2023-09-04 21:30:12,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-04 21:30:12,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-04 21:30:12,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-04 21:30:12,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-04 21:30:12,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-04 21:30:12,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-04 21:30:12,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-04 21:30:12,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-04 21:30:12,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-04 21:30:12,862 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-04 21:30:12,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-04 21:30:12,864 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-04 21:30:12,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-04 21:30:12,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-04 21:30:12,865 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-04 21:30:12,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-04 21:30:12,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-04 21:30:12,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-04 21:30:12,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-04 21:30:12,866 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-04 21:30:12,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-04 21:30:12,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-04 21:30:12,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-04 21:30:12,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-04 21:30:12,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-04 21:30:12,867 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-04 21:30:12,867 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-04 21:30:12,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-09-04 21:30:13,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-04 21:30:13,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-04 21:30:13,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-04 21:30:13,113 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-04 21:30:13,114 INFO L274 PluginConnector]: CDTParser initialized [2023-09-04 21:30:13,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2023-09-04 21:30:14,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-04 21:30:14,455 INFO L384 CDTParser]: Found 1 translation units. [2023-09-04 21:30:14,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2023-09-04 21:30:14,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e0d52d2/7ca0f3cb7a6c438ea19a2c119447a855/FLAGa7cab049c [2023-09-04 21:30:14,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e0d52d2/7ca0f3cb7a6c438ea19a2c119447a855 [2023-09-04 21:30:14,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-04 21:30:14,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-04 21:30:14,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-04 21:30:14,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-04 21:30:14,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-04 21:30:14,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118bd5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:14, skipping insertion in model container [2023-09-04 21:30:14,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:30:14" (1/1) ... [2023-09-04 21:30:14,554 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-09-04 21:30:14,995 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_longer.i[43296,43309] [2023-09-04 21:30:15,001 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_longer.i[43503,43516] [2023-09-04 21:30:15,007 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_longer.i[43783,43796] [2023-09-04 21:30:15,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-04 21:30:15,028 INFO L201 MainTranslator]: Completed pre-run [2023-09-04 21:30:15,060 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-04 21:30:15,061 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-04 21:30:15,068 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-04 21:30:15,084 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_longer.i[43296,43309] [2023-09-04 21:30:15,086 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_longer.i[43503,43516] [2023-09-04 21:30:15,089 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_longer.i[43783,43796] [2023-09-04 21:30:15,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-04 21:30:15,133 INFO L206 MainTranslator]: Completed translation [2023-09-04 21:30:15,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15 WrapperNode [2023-09-04 21:30:15,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-04 21:30:15,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-04 21:30:15,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-04 21:30:15,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-04 21:30:15,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,186 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-09-04 21:30:15,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-04 21:30:15,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-04 21:30:15,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-04 21:30:15,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-04 21:30:15,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-04 21:30:15,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-04 21:30:15,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-04 21:30:15,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-04 21:30:15,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (1/1) ... [2023-09-04 21:30:15,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-04 21:30:15,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:30:15,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-04 21:30:15,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-04 21:30:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-04 21:30:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-04 21:30:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-04 21:30:15,295 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-04 21:30:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-04 21:30:15,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-04 21:30:15,298 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-04 21:30:15,464 INFO L236 CfgBuilder]: Building ICFG [2023-09-04 21:30:15,466 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-04 21:30:15,896 INFO L277 CfgBuilder]: Performing block encoding [2023-09-04 21:30:15,902 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-04 21:30:15,903 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-04 21:30:15,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:30:15 BoogieIcfgContainer [2023-09-04 21:30:15,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-04 21:30:15,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-04 21:30:15,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-04 21:30:15,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-04 21:30:15,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:30:14" (1/3) ... [2023-09-04 21:30:15,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38159883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:30:15, skipping insertion in model container [2023-09-04 21:30:15,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:30:15" (2/3) ... [2023-09-04 21:30:15,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38159883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:30:15, skipping insertion in model container [2023-09-04 21:30:15,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:30:15" (3/3) ... [2023-09-04 21:30:15,919 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-09-04 21:30:15,927 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-04 21:30:15,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-04 21:30:15,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-09-04 21:30:15,936 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-04 21:30:16,040 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-04 21:30:16,087 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-04 21:30:16,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-04 21:30:16,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:30:16,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-04 21:30:16,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-04 21:30:16,132 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-04 21:30:16,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-04 21:30:16,145 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;@54815a9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-04 21:30:16,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-04 21:30:16,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:16,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:16,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1389819344, now seen corresponding path program 1 times [2023-09-04 21:30:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:16,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985830751] [2023-09-04 21:30:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985830751] [2023-09-04 21:30:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985830751] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:16,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-04 21:30:16,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62175686] [2023-09-04 21:30:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:16,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-04 21:30:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-04 21:30:16,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-04 21:30:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:16,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:16,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-04 21:30:16,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:16,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:16,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1534507384, now seen corresponding path program 1 times [2023-09-04 21:30:16,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:16,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690508595] [2023-09-04 21:30:16,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:16,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690508595] [2023-09-04 21:30:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690508595] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-04 21:30:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809991999] [2023-09-04 21:30:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:16,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-04 21:30:16,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-04 21:30:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-04 21:30:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:16,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:16,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:16,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-04 21:30:16,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:16,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236260, now seen corresponding path program 1 times [2023-09-04 21:30:16,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794298453] [2023-09-04 21:30:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:19,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:19,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794298453] [2023-09-04 21:30:19,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794298453] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:19,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:19,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-09-04 21:30:19,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344322595] [2023-09-04 21:30:19,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:19,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-04 21:30:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-04 21:30:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-09-04 21:30:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:19,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:19,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:19,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:19,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:19,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:19,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-04 21:30:19,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:19,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 934072322, now seen corresponding path program 1 times [2023-09-04 21:30:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135264343] [2023-09-04 21:30:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135264343] [2023-09-04 21:30:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135264343] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:28,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:28,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-09-04 21:30:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478693320] [2023-09-04 21:30:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:28,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-04 21:30:28,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-04 21:30:28,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2023-09-04 21:30:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:28,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:28,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:28,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:28,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:28,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:28,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-04 21:30:31,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-04 21:30:31,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:31,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1713858353, now seen corresponding path program 1 times [2023-09-04 21:30:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:31,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776551324] [2023-09-04 21:30:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776551324] [2023-09-04 21:30:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776551324] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:31,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:31,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-04 21:30:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110338054] [2023-09-04 21:30:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:31,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-04 21:30:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-04 21:30:31,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-04 21:30:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:31,686 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:31,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:31,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:31,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:31,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:31,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-09-04 21:30:31,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:30:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:30:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-04 21:30:32,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:32,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1273290990, now seen corresponding path program 1 times [2023-09-04 21:30:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466737574] [2023-09-04 21:30:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-09-04 21:30:32,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:32,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466737574] [2023-09-04 21:30:32,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466737574] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:32,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:32,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-04 21:30:32,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54123298] [2023-09-04 21:30:32,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:32,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-04 21:30:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:32,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-04 21:30:32,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-04 21:30:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:32,412 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:32,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:32,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:32,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:32,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:30:32,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:30:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:30:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:32,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-04 21:30:32,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:32,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 923390222, now seen corresponding path program 2 times [2023-09-04 21:30:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:32,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678864849] [2023-09-04 21:30:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-04 21:30:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678864849] [2023-09-04 21:30:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678864849] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:30:32,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:30:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-04 21:30:32,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150596389] [2023-09-04 21:30:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:30:32,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-04 21:30:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-04 21:30:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-04 21:30:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:32,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:32,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:32,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:32,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:32,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:30:32,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:32,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:30:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:30:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:32,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-04 21:30:32,675 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:30:32,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:30:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash -226095519, now seen corresponding path program 1 times [2023-09-04 21:30:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:30:32,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120339695] [2023-09-04 21:30:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:30:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-04 21:30:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:30:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120339695] [2023-09-04 21:30:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120339695] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 21:30:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025162649] [2023-09-04 21:30:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:30:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 21:30:38,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:30:38,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 21:30:38,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-04 21:30:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:30:38,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 104 conjunts are in the unsatisfiable core [2023-09-04 21:30:38,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 21:30:38,493 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-04 21:30:38,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-04 21:30:38,571 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-04 21:30:38,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-04 21:30:38,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 21:30:38,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-09-04 21:30:39,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-04 21:30:39,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-04 21:30:39,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-04 21:30:39,964 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-09-04 21:30:39,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2023-09-04 21:30:40,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-04 21:30:40,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-09-04 21:30:40,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:30:40,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-04 21:30:41,078 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-09-04 21:30:41,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-09-04 21:30:41,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-04 21:30:41,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-09-04 21:30:41,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:30:41,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-04 21:30:41,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-04 21:30:41,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-04 21:30:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-09-04 21:30:41,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 21:30:43,538 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_386) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|))))) is different from false [2023-09-04 21:30:43,554 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_386) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|))))) is different from false [2023-09-04 21:30:43,570 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_386) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|)))))) is different from false [2023-09-04 21:30:43,599 WARN L839 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_386) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|))))))) is different from false [2023-09-04 21:30:43,617 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse3 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ .cse0 1) v_ArrVal_386) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|)))))))) is different from false [2023-09-04 21:30:43,670 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse3 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (< (+ .cse0 1) v_ArrVal_386)))))))) is different from false [2023-09-04 21:30:43,740 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_382)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select .cse4 .cse5))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (= 400 .cse3) (< (+ .cse3 1) v_ArrVal_386)))))) is different from false [2023-09-04 21:30:43,765 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_382)))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse4 .cse5)) (.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ .cse0 1) v_ArrVal_386) (= 400 .cse0) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse3 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|))))))) is different from false [2023-09-04 21:30:43,813 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_382)))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_384) .cse5 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse4 .cse5))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (= 400 .cse2) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_391) .cse1 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ .cse2 1) v_ArrVal_386))))))) is different from false [2023-09-04 21:30:46,763 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_386 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_384 Int) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_388 (Array Int Int))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_381))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse4) 4)) v_ArrVal_382))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse1 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_384) .cse4 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse4))) (or (< (+ 1 .cse0) v_ArrVal_386) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) .cse3 v_ArrVal_391) .cse4 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (= 400 .cse0))))))) is different from false [2023-09-04 21:30:47,148 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_378 Int) (v_ArrVal_389 Int) (v_ArrVal_386 Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_378)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_381))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_382))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse1 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_384) .cse4 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse2 (select .cse1 |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse4))) (or (= 400 .cse0) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) .cse3 v_ArrVal_391) .cse4 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (< (+ .cse0 1) v_ArrVal_386))))))) is different from false [2023-09-04 21:30:47,182 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_381 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_378 Int) (v_ArrVal_389 Int) (v_ArrVal_376 Int) (v_ArrVal_386 Int) (v_ArrVal_384 Int) (v_ArrVal_382 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) v_ArrVal_376) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_378)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_381))) (let ((.cse5 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_382))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_384) .cse2 v_ArrVal_386)) |c_~#stored_elements~0.base| v_ArrVal_388))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse2))) (or (< 0 v_ArrVal_376) (= 400 .cse0) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_389) .cse4 v_ArrVal_391) .cse2 v_ArrVal_393)) |c_~#stored_elements~0.base| v_ArrVal_395) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< (+ .cse0 1) v_ArrVal_386))))))) is different from false [2023-09-04 21:30:47,205 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:47,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 522 treesize of output 292 [2023-09-04 21:30:47,228 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:47,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 769 treesize of output 761 [2023-09-04 21:30:47,253 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 246 treesize of output 230 [2023-09-04 21:30:47,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 457 [2023-09-04 21:30:47,298 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 476 treesize of output 412 [2023-09-04 21:30:47,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2023-09-04 21:30:47,450 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:47,450 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 16 treesize of output 8 [2023-09-04 21:30:47,560 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:47,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 204 [2023-09-04 21:30:49,450 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-04 21:30:49,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 114 [2023-09-04 21:30:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-09-04 21:30:49,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025162649] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-04 21:30:49,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-04 21:30:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 33, 35] total 107 [2023-09-04 21:30:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919448667] [2023-09-04 21:30:49,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-04 21:30:49,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2023-09-04 21:30:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:30:49,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2023-09-04 21:30:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=8242, Unknown=77, NotChecked=2364, Total=11342 [2023-09-04 21:30:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:49,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:30:49,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 4.88785046728972) internal successors, (523), 107 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:30:49,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:01,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-04 21:31:03,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:31:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:31:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:31:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-09-04 21:31:12,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-04 21:31:12,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-09-04 21:31:12,667 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:31:12,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:31:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -644274329, now seen corresponding path program 1 times [2023-09-04 21:31:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:31:12,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711685696] [2023-09-04 21:31:12,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:31:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:31:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:31:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-09-04 21:31:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:31:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711685696] [2023-09-04 21:31:15,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711685696] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-04 21:31:15,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-04 21:31:15,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-09-04 21:31:15,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649969863] [2023-09-04 21:31:15,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-04 21:31:15,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-04 21:31:15,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-04 21:31:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-04 21:31:15,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2023-09-04 21:31:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:15,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-04 21:31:15,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.433333333333334) internal successors, (193), 30 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-09-04 21:31:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:19,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-04 21:31:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-09-04 21:31:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-04 21:31:37,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-04 21:31:37,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-04 21:31:37,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-04 21:31:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1705847134, now seen corresponding path program 1 times [2023-09-04 21:31:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-04 21:31:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552443049] [2023-09-04 21:31:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:31:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-04 21:31:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:31:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-04 21:31:44,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-04 21:31:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552443049] [2023-09-04 21:31:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552443049] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-04 21:31:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137938097] [2023-09-04 21:31:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-04 21:31:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-04 21:31:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-04 21:31:44,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-04 21:31:44,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-04 21:31:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-04 21:31:44,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 136 conjunts are in the unsatisfiable core [2023-09-04 21:31:44,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-04 21:31:44,689 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-04 21:31:44,689 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-04 21:31:44,763 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-04 21:31:44,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-04 21:31:45,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-04 21:31:45,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-09-04 21:31:45,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-04 21:31:46,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-04 21:31:46,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-09-04 21:31:46,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-09-04 21:31:47,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-09-04 21:31:47,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:47,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-09-04 21:31:48,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:48,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-04 21:31:48,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:48,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-04 21:31:48,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:48,700 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2023-09-04 21:31:48,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:48,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:48,912 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2023-09-04 21:31:49,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:49,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-09-04 21:31:49,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-09-04 21:31:49,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-04 21:31:49,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-09-04 21:31:50,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-04 21:31:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-09-04 21:31:50,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-04 21:31:50,423 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse1) 1)))) (or .cse0 (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-09-04 21:31:50,521 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0)) (.cse0 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse0) 1))) (not .cse1)) (or .cse1 (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_590) |c_~#stored_elements~0.base|) .cse0) 0)))))) is different from false [2023-09-04 21:32:12,435 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ (* (select .cse4 .cse7) 4) |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_~i~0#1_24| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_24| 0) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse4 .cse5 v_ArrVal_581) .cse6 v_ArrVal_583) .cse7 v_ArrVal_586)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_24| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_588))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))))) 0) (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)))))))) (forall ((|v_t1Thread1of1ForFork0_~i~0#1_24| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_24| 0) (forall ((v_ArrVal_588 Int) (v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_581 Int)) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse4 .cse5 v_ArrVal_581) .cse6 v_ArrVal_583) .cse7 v_ArrVal_586)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_24| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_588))))) (or (not (= (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (select .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))))) 0)) (forall ((v_ArrVal_590 (Array Int Int))) (not (= (select (select (store .cse9 |c_~#queue~0.base| v_ArrVal_590) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))))))))))) is different from false [2023-09-04 21:32:43,482 WARN L234 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-09-04 21:34:18,508 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 21:34:18,509 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 21:34:18,509 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-04 21:34:19,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-09-04 21:34:19,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-04 21:34:19,680 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-04 21:34:19,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-04 21:34:19,680 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-09-04 21:34:19,681 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-04 21:34:19,682 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-04 21:34:19,682 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-04 21:34:19,682 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-09-04 21:34:19,682 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-09-04 21:34:19,682 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-04 21:34:19,693 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-04 21:34:19,696 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-04 21:34:19,696 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-04 21:34:19,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:34:19 BasicIcfg [2023-09-04 21:34:19,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-04 21:34:19,698 INFO L158 Benchmark]: Toolchain (without parser) took 245214.41ms. Allocated memory was 222.3MB in the beginning and 782.2MB in the end (delta: 559.9MB). Free memory was 170.5MB in the beginning and 328.5MB in the end (delta: -158.0MB). Peak memory consumption was 402.5MB. Max. memory is 7.0GB. [2023-09-04 21:34:19,698 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 166.7MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-04 21:34:19,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.53ms. Allocated memory is still 222.3MB. Free memory was 170.5MB in the beginning and 140.0MB in the end (delta: 30.6MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. [2023-09-04 21:34:19,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.96ms. Allocated memory is still 222.3MB. Free memory was 140.0MB in the beginning and 137.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-04 21:34:19,699 INFO L158 Benchmark]: Boogie Preprocessor took 48.87ms. Allocated memory is still 222.3MB. Free memory was 137.0MB in the beginning and 134.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-04 21:34:19,699 INFO L158 Benchmark]: RCFGBuilder took 673.20ms. Allocated memory is still 222.3MB. Free memory was 134.9MB in the beginning and 183.3MB in the end (delta: -48.4MB). Peak memory consumption was 25.0MB. Max. memory is 7.0GB. [2023-09-04 21:34:19,699 INFO L158 Benchmark]: TraceAbstraction took 243785.42ms. Allocated memory was 222.3MB in the beginning and 782.2MB in the end (delta: 559.9MB). Free memory was 182.8MB in the beginning and 328.5MB in the end (delta: -145.7MB). Peak memory consumption was 414.2MB. Max. memory is 7.0GB. [2023-09-04 21:34:19,700 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 166.7MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 649.53ms. Allocated memory is still 222.3MB. Free memory was 170.5MB in the beginning and 140.0MB in the end (delta: 30.6MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 51.96ms. Allocated memory is still 222.3MB. Free memory was 140.0MB in the beginning and 137.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 48.87ms. Allocated memory is still 222.3MB. Free memory was 137.0MB in the beginning and 134.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 673.20ms. Allocated memory is still 222.3MB. Free memory was 134.9MB in the beginning and 183.3MB in the end (delta: -48.4MB). Peak memory consumption was 25.0MB. Max. memory is 7.0GB. * TraceAbstraction took 243785.42ms. Allocated memory was 222.3MB in the beginning and 782.2MB in the end (delta: 559.9MB). Free memory was 182.8MB in the beginning and 328.5MB in the end (delta: -145.7MB). Peak memory consumption was 414.2MB. 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 [2023-09-04 21:34:19,713 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 289, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 246, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 256, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 256, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 256, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 246, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 246, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 256, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 246, unknown conditional: 0, unknown unconditional: 246] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 244, Positive conditional cache size: 0, Positive unconditional cache size: 244, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 43 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 11 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 243.6s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 49.4s, 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: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.8s InterpolantComputationTime, 1603 NumberOfCodeBlocks, 1603 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1786 ConstructedInterpolants, 118 QuantifiedInterpolants, 40440 SizeOfPredicates, 35 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 335/352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown