/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 14:21:43,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 14:21:43,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 14:21:43,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 14:21:43,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 14:21:43,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 14:21:43,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 14:21:43,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 14:21:43,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 14:21:43,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 14:21:43,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 14:21:43,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 14:21:43,238 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 14:21:43,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 14:21:43,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 14:21:43,240 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 14:21:43,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 14:21:43,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 14:21:43,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 14:21:43,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 14:21:43,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 14:21:43,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 14:21:43,241 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 14:21:43,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 14:21:43,241 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 14:21:43,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 14:21:43,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 14:21:43,242 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 14:21:43,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 14:21:43,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:21:43,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 14:21:43,243 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 14:21:43,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 14:21:43,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 14:21:43,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 14:21:43,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 14:21:43,446 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 14:21:43,447 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 14:21:43,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2023-11-17 14:21:44,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 14:21:44,554 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 14:21:44,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2023-11-17 14:21:44,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc1bf83a/a3a5e9375e6642be90bd4454de2b586c/FLAG971860d9b [2023-11-17 14:21:44,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc1bf83a/a3a5e9375e6642be90bd4454de2b586c [2023-11-17 14:21:44,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 14:21:44,987 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 14:21:44,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 14:21:44,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 14:21:44,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 14:21:44,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:21:44" (1/1) ... [2023-11-17 14:21:44,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7230b6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:44, skipping insertion in model container [2023-11-17 14:21:44,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:21:44" (1/1) ... [2023-11-17 14:21:45,011 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 14:21:45,112 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2592,2605] [2023-11-17 14:21:45,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:21:45,123 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 14:21:45,137 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2592,2605] [2023-11-17 14:21:45,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:21:45,144 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 14:21:45,144 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 14:21:45,148 INFO L206 MainTranslator]: Completed translation [2023-11-17 14:21:45,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45 WrapperNode [2023-11-17 14:21:45,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 14:21:45,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 14:21:45,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 14:21:45,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 14:21:45,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,171 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2023-11-17 14:21:45,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 14:21:45,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 14:21:45,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 14:21:45,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 14:21:45,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 14:21:45,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 14:21:45,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 14:21:45,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 14:21:45,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (1/1) ... [2023-11-17 14:21:45,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:21:45,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:45,229 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-11-17 14:21:45,245 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-11-17 14:21:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 14:21:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 14:21:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 14:21:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 14:21:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 14:21:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 14:21:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 14:21:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 14:21:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 14:21:45,252 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 14:21:45,321 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 14:21:45,323 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 14:21:45,513 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 14:21:45,649 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 14:21:45,650 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 14:21:45,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:21:45 BoogieIcfgContainer [2023-11-17 14:21:45,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 14:21:45,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 14:21:45,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 14:21:45,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 14:21:45,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:21:44" (1/3) ... [2023-11-17 14:21:45,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6148994e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:21:45, skipping insertion in model container [2023-11-17 14:21:45,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:45" (2/3) ... [2023-11-17 14:21:45,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6148994e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:21:45, skipping insertion in model container [2023-11-17 14:21:45,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:21:45" (3/3) ... [2023-11-17 14:21:45,656 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2023-11-17 14:21:45,663 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 14:21:45,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 14:21:45,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 14:21:45,670 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 14:21:45,721 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 14:21:45,753 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 14:21:45,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 14:21:45,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:45,756 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-11-17 14:21:45,790 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 14:21:45,792 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-11-17 14:21:45,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 14:21:45,806 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ebbc786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 14:21:45,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 14:21:46,012 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 1 more)] === [2023-11-17 14:21:46,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1930950995, now seen corresponding path program 1 times [2023-11-17 14:21:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:46,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974971465] [2023-11-17 14:21:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 14:21:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:46,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974971465] [2023-11-17 14:21:46,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974971465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:21:46,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 14:21:46,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 14:21:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98273202] [2023-11-17 14:21:46,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:21:46,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 14:21:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:46,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 14:21:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 14:21:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:46,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:46,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-17 14:21:46,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:46,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 14:21:46,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:46,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -396428694, now seen corresponding path program 1 times [2023-11-17 14:21:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316029846] [2023-11-17 14:21:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:46,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316029846] [2023-11-17 14:21:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316029846] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579657901] [2023-11-17 14:21:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:46,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:46,644 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-11-17 14:21:46,647 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-11-17 14:21:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:46,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 14:21:46,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:46,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579657901] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:21:46,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:21:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-17 14:21:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560765403] [2023-11-17 14:21:46,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:21:46,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 14:21:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 14:21:46,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-17 14:21:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:46,930 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:46,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 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-11-17 14:21:46,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:46,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:47,081 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-11-17 14:21:47,279 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,SelfDestructingSolverStorable1 [2023-11-17 14:21:47,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:47,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash 469244979, now seen corresponding path program 2 times [2023-11-17 14:21:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:47,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927231257] [2023-11-17 14:21:47,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927231257] [2023-11-17 14:21:47,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927231257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507327869] [2023-11-17 14:21:47,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 14:21:47,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:47,379 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-11-17 14:21:47,393 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-11-17 14:21:47,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 14:21:47,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:21:47,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 14:21:47,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:47,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507327869] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:21:47,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:21:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 14:21:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657060662] [2023-11-17 14:21:47,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:21:47,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 14:21:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:47,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 14:21:47,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 14:21:47,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:47,642 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:47,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 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-11-17 14:21:47,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:47,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:47,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:21:47,772 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-11-17 14:21:47,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:47,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:47,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 312678504, now seen corresponding path program 3 times [2023-11-17 14:21:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:47,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216510098] [2023-11-17 14:21:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:21:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216510098] [2023-11-17 14:21:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216510098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441488354] [2023-11-17 14:21:49,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 14:21:49,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:49,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:49,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:21:49,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 14:21:49,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 14:21:49,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:21:49,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-17 14:21:49,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:21:49,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:21:49,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-17 14:21:49,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 14:21:49,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 14:21:49,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 14:21:49,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-17 14:21:50,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:50,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 151 treesize of output 93 [2023-11-17 14:21:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:21:51,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:52,221 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~max1~0 1)) (.cse4 (+ c_~max2~0 1)) (.cse7 (+ c_~A~0.offset (* c_thread2Thread1of1ForFork2_~i~1 4))) (.cse2 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse2))) (or (< c_~max2~0 .cse0) (= .cse0 c_~max2~0) (< .cse0 .cse1)))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse2)) (.cse3 (select .cse6 .cse7))) (or (< .cse3 .cse4) (< c_~max1~0 .cse5) (= c_~max1~0 .cse5) (< .cse5 (+ .cse3 1)))))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse9 (select .cse8 .cse2))) (or (< c_~max2~0 (select .cse8 .cse7)) (< .cse9 .cse4) (< c_~max1~0 .cse9) (= c_~max1~0 .cse9))))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse7)) (.cse11 (select .cse12 .cse2))) (or (= .cse10 .cse11) (< .cse10 .cse11) (< .cse11 .cse1))))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse2)) (.cse13 (select .cse15 .cse7))) (or (< .cse13 .cse4) (< .cse13 .cse14) (< c_~max1~0 .cse14) (= .cse13 c_~max1~0))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse2))) (or (< c_~max2~0 .cse16) (< c_~max2~0 (select .cse17 .cse7)) (< c_~max1~0 .cse16)))))))) is different from false [2023-11-17 14:21:52,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~max1~0 1)) (.cse5 (+ c_~max2~0 1)) (.cse2 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse2))) (or (< c_~max2~0 .cse0) (= .cse0 c_~max2~0) (< .cse0 .cse1)))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse4 (select .cse3 .cse2))) (or (< c_~max2~0 (select .cse3 c_~A~0.offset)) (< .cse4 .cse5) (< c_~max1~0 .cse4) (= c_~max1~0 .cse4))))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 c_~A~0.offset))) (or (< .cse6 .cse5) (< c_~max1~0 .cse7) (= c_~max1~0 .cse7) (< .cse7 (+ .cse6 1)))))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset)) (.cse9 (select .cse11 .cse2))) (or (= .cse9 .cse10) (< .cse10 .cse9) (< .cse9 .cse1))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse2))) (or (< c_~max2~0 .cse12) (< c_~max2~0 (select .cse13 c_~A~0.offset)) (< c_~max1~0 .cse12)))))) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse14 (select .cse16 c_~A~0.offset)) (.cse15 (select .cse16 .cse2))) (or (= c_~max1~0 .cse14) (< .cse14 .cse5) (< c_~max1~0 .cse15) (< .cse14 .cse15))))))) is different from false [2023-11-17 14:21:53,081 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~max2~0 1)) (.cse4 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (.cse13 (+ c_~max1~0 1)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse3 (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse4))) (or (< c_~max2~0 .cse0) (< c_~max1~0 .cse0) (< c_~max1~0 (select (select .cse1 c_~A~0.base) .cse2)) (< c_~max2~0 (select .cse3 c_~A~0.offset)))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse5 c_~A~0.base) .cse2)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse8 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse4))) (or (< c_~max1~0 .cse6) (< .cse6 .cse7) (= c_~max1~0 .cse6) (< c_~max2~0 (select .cse8 c_~A~0.offset))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse10 (select (select .cse12 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse4))) (or (< .cse9 .cse7) (< .cse10 .cse9) (= .cse10 .cse9) (< c_~max2~0 (select .cse11 c_~A~0.offset)))))) (< .cse10 .cse13))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse14 c_~A~0.base) .cse2)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse17 (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse15 (select .cse17 c_~A~0.offset)) (.cse16 (select .cse17 .cse4))) (or (= .cse15 .cse16) (< .cse16 .cse13) (< .cse15 .cse16)))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse19 (select (select .cse22 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse21 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse4)) (.cse18 (select .cse21 c_~A~0.offset))) (or (< .cse18 .cse7) (< .cse19 .cse20) (= .cse19 .cse20) (< .cse20 (+ .cse18 1)))))) (< .cse19 .cse13))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse23 c_~A~0.base) .cse2)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse26 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse24 (select .cse26 c_~A~0.offset)) (.cse25 (select .cse26 .cse4))) (or (= c_~max1~0 .cse24) (< c_~max1~0 .cse25) (< .cse24 .cse7) (< .cse24 .cse25)))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse28 (select (select .cse31 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse30 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse27 (select .cse30 c_~A~0.offset)) (.cse29 (select .cse30 .cse4))) (or (< .cse27 .cse7) (= .cse28 .cse27) (< .cse28 .cse29) (< .cse27 .cse29))))) (< .cse28 .cse13))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse33 (select (select .cse35 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse34 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse4))) (or (< c_~max2~0 .cse32) (< .cse33 .cse32) (< c_~max2~0 (select .cse34 c_~A~0.offset)))))) (= .cse33 c_~max2~0) (< .cse33 .cse13))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse36 c_~A~0.base) .cse2)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse37 (select (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse4))) (or (< c_~max2~0 .cse37) (= c_~max2~0 .cse37) (< .cse37 .cse13))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse39 (select (select .cse40 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse38 (select (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse4))) (or (< c_~max2~0 .cse38) (= c_~max2~0 .cse38) (< .cse38 (+ .cse39 1))))) (< .cse39 .cse13))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse41 c_~A~0.base) .cse2)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse44 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse43 (select .cse44 c_~A~0.offset)) (.cse42 (select .cse44 .cse4))) (or (< c_~max1~0 .cse42) (< .cse43 .cse7) (< .cse42 (+ .cse43 1)) (= c_~max1~0 .cse42)))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse47 (select (select .cse49 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse48 (select (store .cse49 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse45 (select .cse48 c_~A~0.offset)) (.cse46 (select .cse48 .cse4))) (or (= .cse45 .cse46) (< .cse46 (+ .cse47 1)) (< .cse45 .cse46))))) (< .cse47 .cse13))))))) is different from false [2023-11-17 14:21:53,246 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~max1~0 1)) (.cse9 (+ c_~max2~0 1)) (.cse5 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse0 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse2 (select .cse4 c_~A~0.offset)) (.cse3 (select .cse4 .cse5))) (or (= .cse2 .cse3) (< .cse3 (+ .cse0 1)) (< .cse2 .cse3))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse7 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (or (< .cse7 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse8 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 .cse5))) (or (< .cse8 .cse9) (= .cse7 .cse8) (< .cse7 .cse10) (< .cse8 .cse10))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse13 (select (select .cse16 c_~A~0.base) c_~A~0.offset))) (or (< .cse13 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse15 (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5))) (or (< .cse14 .cse9) (= .cse13 .cse14) (< .cse13 .cse14) (< c_~max2~0 (select .cse15 c_~A~0.offset)))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse17 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (or (< .cse17 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse5))) (or (< c_~max2~0 .cse18) (= c_~max2~0 .cse18) (< .cse18 (+ .cse17 1))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse22 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse20 (select .cse22 c_~A~0.offset)) (.cse21 (select .cse22 .cse5))) (or (= c_~max1~0 .cse20) (< c_~max1~0 .cse21) (< .cse20 .cse9) (< .cse20 .cse21))))) (< c_~max1~0 (select (select .cse23 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse24 (select (select .cse28 c_~A~0.base) c_~A~0.offset))) (or (< .cse24 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse27 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse25 (select .cse27 c_~A~0.offset)) (.cse26 (select .cse27 .cse5))) (or (< .cse25 .cse9) (= .cse24 .cse26) (< .cse26 (+ .cse25 1)) (< .cse24 .cse26))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse30 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse29 (select .cse30 .cse5))) (or (< c_~max1~0 .cse29) (< .cse29 .cse9) (= c_~max1~0 .cse29) (< c_~max2~0 (select .cse30 c_~A~0.offset)))))) (< c_~max1~0 (select (select .cse31 c_~A~0.base) c_~A~0.offset))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse34 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse5))) (or (< c_~max2~0 .cse32) (< c_~max1~0 .cse32) (< c_~max1~0 (select (select .cse33 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 (select .cse34 c_~A~0.offset)))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse35 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse38 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse36 (select .cse38 c_~A~0.offset)) (.cse37 (select .cse38 .cse5))) (or (= .cse36 .cse37) (< .cse37 .cse1) (< .cse36 .cse37)))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse39 (select (select .cse42 c_~A~0.base) c_~A~0.offset))) (or (< .cse39 .cse1) (= .cse39 c_~max2~0) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse41 (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse40 (select .cse41 .cse5))) (or (< c_~max2~0 .cse40) (< .cse39 .cse40) (< c_~max2~0 (select .cse41 c_~A~0.offset)))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse43 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse44 (select (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse5))) (or (< c_~max2~0 .cse44) (= c_~max2~0 .cse44) (< .cse44 .cse1))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse47 (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse46 (select .cse47 c_~A~0.offset)) (.cse45 (select .cse47 .cse5))) (or (< c_~max1~0 .cse45) (< .cse46 .cse9) (< .cse45 (+ .cse46 1)) (= c_~max1~0 .cse45))))) (< c_~max1~0 (select (select .cse48 c_~A~0.base) c_~A~0.offset))))))) is different from false [2023-11-17 14:21:54,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2023-11-17 14:21:54,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3649 treesize of output 3473 [2023-11-17 14:21:54,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 231 [2023-11-17 14:21:54,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 424 treesize of output 368 [2023-11-17 14:21:54,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 195 [2023-11-17 14:21:54,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 129 [2023-11-17 14:21:54,459 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 14:21:54,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3985 treesize of output 3653 [2023-11-17 14:21:54,511 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-17 14:21:54,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 483 treesize of output 386 [2023-11-17 14:21:54,526 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 14:21:54,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 171 [2023-11-17 14:21:54,539 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 14:21:54,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 167 [2023-11-17 14:21:54,673 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 1 [2023-11-17 14:21:54,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 109 [2023-11-17 14:21:54,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 14:21:54,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1090 treesize of output 1005 [2023-11-17 14:21:54,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 14:21:54,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 440 treesize of output 380 [2023-11-17 14:21:54,744 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 14:21:54,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 231 [2023-11-17 14:21:54,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 14:21:54,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 434 treesize of output 390 [2023-11-17 14:21:54,872 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 1 [2023-11-17 14:21:54,877 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 1 [2023-11-17 14:21:54,882 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 1 [2023-11-17 14:21:54,887 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 1 [2023-11-17 14:21:54,893 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 1 [2023-11-17 14:21:54,898 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 1 [2023-11-17 14:21:54,903 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-11-17 14:21:54,908 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 14:21:54,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 1 [2023-11-17 14:21:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:21:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441488354] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:21:55,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:21:55,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 52 [2023-11-17 14:21:55,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516534026] [2023-11-17 14:21:55,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:21:55,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-17 14:21:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-17 14:21:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2155, Unknown=4, NotChecked=388, Total=2756 [2023-11-17 14:21:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:55,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:55,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.8113207547169812) internal successors, (96), 52 states have internal predecessors, (96), 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-11-17 14:21:55,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:55,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:55,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:21:55,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:55,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 0)) (.cse1 (= c_~max2~0 0)) (.cse34 (= c_~max1~0 c_~max2~0)) (.cse3 (+ c_~max1~0 1)) (.cse11 (+ c_~max2~0 1)) (.cse7 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (or (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (< c_~M~0 1)) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse2 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (< .cse2 .cse3) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse6 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse4 (select .cse6 c_~A~0.offset)) (.cse5 (select .cse6 .cse7))) (or (= .cse4 .cse5) (< .cse5 (+ .cse2 1)) (< .cse4 .cse5))))))))) (<= c_~M~0 1) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse9 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (< .cse9 .cse3) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse13 (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse10 (select .cse13 c_~A~0.offset)) (.cse12 (select .cse13 .cse7))) (or (< .cse10 .cse11) (= .cse9 .cse10) (< .cse9 .cse12) (< .cse10 .cse12))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse15 (select (select .cse18 c_~A~0.base) c_~A~0.offset))) (or (< .cse15 .cse3) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse17 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse7))) (or (< .cse16 .cse11) (= .cse15 .cse16) (< .cse15 .cse16) (< c_~max2~0 (select .cse17 c_~A~0.offset)))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse19 (select (select .cse21 c_~A~0.base) c_~A~0.offset))) (or (< .cse19 .cse3) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse7))) (or (< c_~max2~0 .cse20) (= c_~max2~0 .cse20) (< .cse20 (+ .cse19 1))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse24 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse22 (select .cse24 c_~A~0.offset)) (.cse23 (select .cse24 .cse7))) (or (= c_~max1~0 .cse22) (< c_~max1~0 .cse23) (< .cse22 .cse11) (< .cse22 .cse23))))) (< c_~max1~0 (select (select .cse25 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse26 (select (select .cse30 c_~A~0.base) c_~A~0.offset))) (or (< .cse26 .cse3) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse29 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse27 (select .cse29 c_~A~0.offset)) (.cse28 (select .cse29 .cse7))) (or (< .cse27 .cse11) (= .cse26 .cse28) (< .cse28 (+ .cse27 1)) (< .cse26 .cse28))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse32 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse7))) (or (< c_~max1~0 .cse31) (< .cse31 .cse11) (= c_~max1~0 .cse31) (< c_~max2~0 (select .cse32 c_~A~0.offset)))))) (< c_~max1~0 (select (select .cse33 c_~A~0.base) c_~A~0.offset))))) (or .cse34 (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse37 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse35 (select .cse37 .cse7))) (or (< c_~max2~0 .cse35) (< c_~max1~0 .cse35) (< c_~max1~0 (select (select .cse36 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 (select .cse37 c_~A~0.offset)))))))) (= c_~A~0.offset 0) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse38 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse41 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse39 (select .cse41 c_~A~0.offset)) (.cse40 (select .cse41 .cse7))) (or (= .cse39 .cse40) (< .cse40 .cse3) (< .cse39 .cse40)))))))) (or (and .cse0 .cse1) (and .cse34 (<= 1 c_~max1~0))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse42 (select (select .cse45 c_~A~0.base) c_~A~0.offset))) (or (< .cse42 .cse3) (= .cse42 c_~max2~0) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse44 (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse43 (select .cse44 .cse7))) (or (< c_~max2~0 .cse43) (< .cse42 .cse43) (< c_~max2~0 (select .cse44 c_~A~0.offset)))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse46 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse47 (select (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse7))) (or (< c_~max2~0 .cse47) (= c_~max2~0 .cse47) (< .cse47 .cse3))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse50 (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse49 (select .cse50 c_~A~0.offset)) (.cse48 (select .cse50 .cse7))) (or (< c_~max1~0 .cse48) (< .cse49 .cse11) (< .cse48 (+ .cse49 1)) (= c_~max1~0 .cse48))))) (< c_~max1~0 (select (select .cse51 c_~A~0.base) c_~A~0.offset))))))) is different from false [2023-11-17 14:21:56,216 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (= c_~max1~0 c_~max2~0)) (.cse1 (+ c_~max1~0 1)) (.cse9 (+ c_~max2~0 1)) (.cse5 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse0 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse2 (select .cse4 c_~A~0.offset)) (.cse3 (select .cse4 .cse5))) (or (= .cse2 .cse3) (< .cse3 (+ .cse0 1)) (< .cse2 .cse3))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse7 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (or (< .cse7 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse8 (select .cse11 c_~A~0.offset)) (.cse10 (select .cse11 .cse5))) (or (< .cse8 .cse9) (= .cse7 .cse8) (< .cse7 .cse10) (< .cse8 .cse10))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse13 (select (select .cse16 c_~A~0.base) c_~A~0.offset))) (or (< .cse13 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse15 (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5))) (or (< .cse14 .cse9) (= .cse13 .cse14) (< .cse13 .cse14) (< c_~max2~0 (select .cse15 c_~A~0.offset)))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse17 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (or (< .cse17 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse5))) (or (< c_~max2~0 .cse18) (= c_~max2~0 .cse18) (< .cse18 (+ .cse17 1))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse22 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse20 (select .cse22 c_~A~0.offset)) (.cse21 (select .cse22 .cse5))) (or (= c_~max1~0 .cse20) (< c_~max1~0 .cse21) (< .cse20 .cse9) (< .cse20 .cse21))))) (< c_~max1~0 (select (select .cse23 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse24 (select (select .cse28 c_~A~0.base) c_~A~0.offset))) (or (< .cse24 .cse1) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse27 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse25 (select .cse27 c_~A~0.offset)) (.cse26 (select .cse27 .cse5))) (or (< .cse25 .cse9) (= .cse24 .cse26) (< .cse26 (+ .cse25 1)) (< .cse24 .cse26))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse30 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse29 (select .cse30 .cse5))) (or (< c_~max1~0 .cse29) (< .cse29 .cse9) (= c_~max1~0 .cse29) (< c_~max2~0 (select .cse30 c_~A~0.offset)))))) (< c_~max1~0 (select (select .cse31 c_~A~0.base) c_~A~0.offset))))) (or .cse32 (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_125 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse35 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse33 (select .cse35 .cse5))) (or (< c_~max2~0 .cse33) (< c_~max1~0 .cse33) (< c_~max1~0 (select (select .cse34 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 (select .cse35 c_~A~0.offset)))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse36 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse39 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse37 (select .cse39 c_~A~0.offset)) (.cse38 (select .cse39 .cse5))) (or (= .cse37 .cse38) (< .cse38 .cse1) (< .cse37 .cse38)))))))) (or (and (= c_~max1~0 0) (= c_~max2~0 0)) (and .cse32 (<= 1 c_~max1~0))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (let ((.cse40 (select (select .cse43 c_~A~0.base) c_~A~0.offset))) (or (< .cse40 .cse1) (= .cse40 c_~max2~0) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse42 (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse41 (select .cse42 .cse5))) (or (< c_~max2~0 .cse41) (< .cse40 .cse41) (< c_~max2~0 (select .cse42 c_~A~0.offset)))))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (< c_~max1~0 (select (select .cse44 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse45 (select (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base) .cse5))) (or (< c_~max2~0 .cse45) (= c_~max2~0 .cse45) (< .cse45 .cse1))))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_124))) (or (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse48 (select (store .cse49 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~A~0.base))) (let ((.cse47 (select .cse48 c_~A~0.offset)) (.cse46 (select .cse48 .cse5))) (or (< c_~max1~0 .cse46) (< .cse47 .cse9) (< .cse46 (+ .cse47 1)) (= c_~max1~0 .cse46))))) (< c_~max1~0 (select (select .cse49 c_~A~0.base) c_~A~0.offset))))))) is different from false [2023-11-17 14:21:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:21:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:21:57,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 14:21:57,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:57,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:57,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash -522018136, now seen corresponding path program 4 times [2023-11-17 14:21:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898760378] [2023-11-17 14:21:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:58,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898760378] [2023-11-17 14:21:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898760378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431984754] [2023-11-17 14:21:58,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 14:21:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:58,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:21:58,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 14:21:58,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 14:21:58,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:21:58,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 14:21:58,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 14:21:58,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 14:21:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431984754] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:21:58,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:21:58,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2023-11-17 14:21:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230436495] [2023-11-17 14:21:58,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:21:58,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-17 14:21:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-17 14:21:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2023-11-17 14:21:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:58,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:58,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 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-11-17 14:21:58,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:21:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:21:58,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:21:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:21:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:21:58,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 14:21:58,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:58,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:58,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1881185560, now seen corresponding path program 5 times [2023-11-17 14:21:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913191991] [2023-11-17 14:21:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-17 14:21:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913191991] [2023-11-17 14:21:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913191991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013862076] [2023-11-17 14:21:59,094 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 14:21:59,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:59,095 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:21:59,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 14:21:59,187 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-11-17 14:21:59,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:21:59,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-17 14:21:59,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-17 14:21:59,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-17 14:21:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013862076] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:21:59,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:21:59,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2023-11-17 14:21:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439989345] [2023-11-17 14:21:59,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:21:59,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-17 14:21:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-17 14:21:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2023-11-17 14:21:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:59,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:59,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 38 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-11-17 14:21:59,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:59,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:21:59,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:21:59,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:21:59,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:21:59,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:22:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:22:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:22:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 14:22:00,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 14:22:00,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:00,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:22:00,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash 893569956, now seen corresponding path program 6 times [2023-11-17 14:22:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:00,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85437875] [2023-11-17 14:22:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-17 14:22:01,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:22:01,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85437875] [2023-11-17 14:22:01,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85437875] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:22:01,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416439405] [2023-11-17 14:22:01,167 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 14:22:01,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:01,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:01,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:22:01,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 14:22:01,381 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-17 14:22:01,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:22:01,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-17 14:22:01,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:22:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 39 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-17 14:22:01,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:22:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 52 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-17 14:22:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416439405] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:22:02,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:22:02,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 44 [2023-11-17 14:22:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406747867] [2023-11-17 14:22:02,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:22:02,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-17 14:22:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:22:02,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-17 14:22:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1633, Unknown=0, NotChecked=0, Total=1892 [2023-11-17 14:22:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:02,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:22:02,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.9545454545454546) internal successors, (130), 44 states have internal predecessors, (130), 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-11-17 14:22:02,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:02,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:22:02,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:02,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:22:02,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:22:02,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-17 14:22:02,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:22:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:22:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:22:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 14:22:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 14:22:03,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 14:22:03,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:03,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:22:03,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -492658118, now seen corresponding path program 7 times [2023-11-17 14:22:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601245062] [2023-11-17 14:22:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-17 14:22:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:22:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601245062] [2023-11-17 14:22:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601245062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:22:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337178898] [2023-11-17 14:22:03,646 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 14:22:03,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:03,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:22:03,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 14:22:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:03,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 14:22:03,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:22:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-17 14:22:04,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:22:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 52 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-17 14:22:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337178898] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:22:04,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:22:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-11-17 14:22:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298417828] [2023-11-17 14:22:04,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:22:04,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-17 14:22:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:22:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-17 14:22:04,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2023-11-17 14:22:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:04,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:22:04,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:22:04,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:04,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:22:04,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:04,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:22:04,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:22:04,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-17 14:22:04,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 14:22:04,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:22:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:22:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:22:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 14:22:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 14:22:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 14:22:04,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 14:22:04,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-17 14:22:04,660 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:22:04,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash -330226735, now seen corresponding path program 8 times [2023-11-17 14:22:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:04,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10350477] [2023-11-17 14:22:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:22:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 21 proven. 64 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-17 14:22:04,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:22:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10350477] [2023-11-17 14:22:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10350477] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:22:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275679231] [2023-11-17 14:22:04,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 14:22:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:04,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:22:04,923 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:22:04,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 14:22:05,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 14:22:05,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:22:05,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 14:22:05,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:22:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 58 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-17 14:22:05,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:22:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 34 proven. 51 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-17 14:22:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275679231] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:22:05,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:22:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 38 [2023-11-17 14:22:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388103508] [2023-11-17 14:22:05,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:22:05,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-17 14:22:05,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:22:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-17 14:22:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1117, Unknown=0, NotChecked=0, Total=1482 [2023-11-17 14:22:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:05,542 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:22:05,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 38 states have internal predecessors, (104), 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-11-17 14:22:05,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-17 14:22:05,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 14:22:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 14:22:05,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 14:22:06,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:22:06,027 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:22:06,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:22:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1625251016, now seen corresponding path program 9 times [2023-11-17 14:22:06,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:22:06,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96350322] [2023-11-17 14:22:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:22:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:22:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:25:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 3 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:25:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:25:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96350322] [2023-11-17 14:25:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96350322] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:25:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546860098] [2023-11-17 14:25:34,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 14:25:34,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:25:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:25:34,866 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:25:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 14:25:35,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-17 14:25:35,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:25:35,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-17 14:25:35,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:25:36,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:25:36,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-17 14:29:35,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:35,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:29:47,281 WARN L293 SmtUtils]: Spent 11.89s on a formula simplification that was a NOOP. DAG size: 1223 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-17 14:29:47,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:29:47,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 26 select indices, 26 select index equivalence classes, 37 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 325 case distinctions, treesize of input 9017 treesize of output 5707 Received shutdown request... [2023-11-17 14:30:57,697 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-11-17 14:30:57,697 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-11-17 14:30:57,701 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 14:30:57,724 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 14:30:57,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 14:30:57,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 14:30:57,931 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 71 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-288-53-8-3-5-3-4-2-4-2-3-1 context. [2023-11-17 14:30:57,933 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 14:30:57,933 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 14:30:57,933 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 14:30:57,936 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1] [2023-11-17 14:30:57,938 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 14:30:57,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 14:30:57,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 02:30:57 BasicIcfg [2023-11-17 14:30:57,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 14:30:57,940 INFO L158 Benchmark]: Toolchain (without parser) took 552952.20ms. Allocated memory was 329.3MB in the beginning and 1.1GB in the end (delta: 814.7MB). Free memory was 288.5MB in the beginning and 852.5MB in the end (delta: -564.0MB). Peak memory consumption was 717.4MB. Max. memory is 8.0GB. [2023-11-17 14:30:57,940 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory was 158.5MB in the beginning and 158.4MB in the end (delta: 137.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 14:30:57,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.39ms. Allocated memory is still 329.3MB. Free memory was 288.0MB in the beginning and 276.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 14:30:57,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.94ms. Allocated memory is still 329.3MB. Free memory was 276.4MB in the beginning and 274.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 14:30:57,940 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 329.3MB. Free memory was 274.4MB in the beginning and 272.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 14:30:57,940 INFO L158 Benchmark]: RCFGBuilder took 447.89ms. Allocated memory is still 329.3MB. Free memory was 272.8MB in the beginning and 228.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2023-11-17 14:30:57,941 INFO L158 Benchmark]: TraceAbstraction took 552287.09ms. Allocated memory was 329.3MB in the beginning and 1.1GB in the end (delta: 814.7MB). Free memory was 228.2MB in the beginning and 852.5MB in the end (delta: -624.3MB). Peak memory consumption was 657.7MB. Max. memory is 8.0GB. [2023-11-17 14:30:57,941 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.09ms. Allocated memory is still 208.7MB. Free memory was 158.5MB in the beginning and 158.4MB in the end (delta: 137.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 160.39ms. Allocated memory is still 329.3MB. Free memory was 288.0MB in the beginning and 276.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.94ms. Allocated memory is still 329.3MB. Free memory was 276.4MB in the beginning and 274.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 329.3MB. Free memory was 274.4MB in the beginning and 272.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 447.89ms. Allocated memory is still 329.3MB. Free memory was 272.8MB in the beginning and 228.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 552287.09ms. Allocated memory was 329.3MB in the beginning and 1.1GB in the end (delta: 814.7MB). Free memory was 228.2MB in the beginning and 852.5MB in the end (delta: -624.3MB). Peak memory consumption was 657.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2813, independent: 2430, independent conditional: 1958, independent unconditional: 472, dependent: 383, dependent conditional: 368, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2488, independent: 2430, independent conditional: 1958, independent unconditional: 472, dependent: 58, dependent conditional: 43, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2488, independent: 2430, independent conditional: 1958, independent unconditional: 472, dependent: 58, dependent conditional: 43, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2637, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 207, dependent conditional: 149, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2637, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 207, dependent conditional: 81, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2637, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 207, dependent conditional: 81, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 439, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 439, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 221, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 190, dependent conditional: 99, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2637, independent: 2025, independent conditional: 0, independent unconditional: 2025, dependent: 173, dependent conditional: 62, dependent unconditional: 111, unknown: 439, unknown conditional: 19, unknown unconditional: 420] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 405, Positive conditional cache size: 0, Positive unconditional cache size: 405, Negative cache size: 34, Negative conditional cache size: 19, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 6, Independence queries for same thread: 325 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 36, Number of trivial persistent sets: 21, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 487, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2813, independent: 2430, independent conditional: 1958, independent unconditional: 472, dependent: 383, dependent conditional: 368, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2488, independent: 2430, independent conditional: 1958, independent unconditional: 472, dependent: 58, dependent conditional: 43, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2488, independent: 2430, independent conditional: 1958, independent unconditional: 472, dependent: 58, dependent conditional: 43, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2637, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 207, dependent conditional: 149, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2637, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 207, dependent conditional: 81, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2637, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 207, dependent conditional: 81, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 439, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 439, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 19, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 221, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 190, dependent conditional: 99, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2637, independent: 2025, independent conditional: 0, independent unconditional: 2025, dependent: 173, dependent conditional: 62, dependent unconditional: 111, unknown: 439, unknown conditional: 19, unknown unconditional: 420] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 405, Positive conditional cache size: 0, Positive unconditional cache size: 405, Negative cache size: 34, Negative conditional cache size: 19, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 6, Independence queries for same thread: 325 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 71 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-288-53-8-3-5-3-4-2-4-2-3-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 71 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-288-53-8-3-5-3-4-2-4-2-3-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 71 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-288-53-8-3-5-3-4-2-4-2-3-1 context. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 71 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-288-53-8-3-5-3-4-2-4-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 50 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 552.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 6.1s, 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: 156, 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.6s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1148 ConstructedInterpolants, 10 QuantifiedInterpolants, 17754 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2176 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 861/1419 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