/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 18:32:47,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 18:32:48,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 18:32:48,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 18:32:48,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 18:32:48,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 18:32:48,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 18:32:48,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 18:32:48,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 18:32:48,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 18:32:48,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 18:32:48,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 18:32:48,083 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 18:32:48,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 18:32:48,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 18:32:48,085 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 18:32:48,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 18:32:48,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 18:32:48,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 18:32:48,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 18:32:48,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 18:32:48,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 18:32:48,088 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 18:32:48,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 18:32:48,088 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 18:32:48,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 18:32:48,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 18:32:48,089 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 18:32:48,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 18:32:48,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:32:48,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 18:32:48,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 18:32:48,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 18:32:48,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 18:32:48,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 18:32:48,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 18:32:48,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 18:32:48,091 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 18:32:48,092 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 18:32:48,092 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 18:32:48,092 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 [2023-11-17 18:32:48,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 18:32:48,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 18:32:48,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 18:32:48,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 18:32:48,309 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 18:32:48,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-11-17 18:32:49,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 18:32:49,668 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 18:32:49,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-11-17 18:32:49,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188288c33/b6615422cd8f42e1b370f489b0555135/FLAG88d99099b [2023-11-17 18:32:49,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188288c33/b6615422cd8f42e1b370f489b0555135 [2023-11-17 18:32:49,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 18:32:49,688 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 18:32:49,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 18:32:49,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 18:32:49,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 18:32:49,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6305327d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49, skipping insertion in model container [2023-11-17 18:32:49,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,717 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 18:32:49,839 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-sorted.wvr.c[2473,2486] [2023-11-17 18:32:49,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:32:49,853 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 18:32:49,872 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-sorted.wvr.c[2473,2486] [2023-11-17 18:32:49,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 18:32:49,887 INFO L206 MainTranslator]: Completed translation [2023-11-17 18:32:49,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49 WrapperNode [2023-11-17 18:32:49,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 18:32:49,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 18:32:49,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 18:32:49,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 18:32:49,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,924 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 108 [2023-11-17 18:32:49,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 18:32:49,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 18:32:49,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 18:32:49,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 18:32:49,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 18:32:49,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 18:32:49,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 18:32:49,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 18:32:49,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (1/1) ... [2023-11-17 18:32:49,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 18:32:49,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:32:50,007 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 18:32:50,030 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 18:32:50,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 18:32:50,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 18:32:50,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 18:32:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 18:32:50,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 18:32:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 18:32:50,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 18:32:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 18:32:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 18:32:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 18:32:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 18:32:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 18:32:50,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 18:32:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 18:32:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 18:32:50,044 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 18:32:50,127 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 18:32:50,129 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 18:32:50,407 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 18:32:50,417 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 18:32:50,418 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 18:32:50,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:32:50 BoogieIcfgContainer [2023-11-17 18:32:50,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 18:32:50,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 18:32:50,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 18:32:50,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 18:32:50,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:32:49" (1/3) ... [2023-11-17 18:32:50,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667769b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:32:50, skipping insertion in model container [2023-11-17 18:32:50,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:32:49" (2/3) ... [2023-11-17 18:32:50,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667769b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:32:50, skipping insertion in model container [2023-11-17 18:32:50,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 06:32:50" (3/3) ... [2023-11-17 18:32:50,426 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2023-11-17 18:32:50,433 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 18:32:50,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 18:32:50,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 18:32:50,442 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 18:32:50,573 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 18:32:50,619 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:32:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 18:32:50,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:32:50,621 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 18:32:50,625 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 18:32:50,652 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 18:32:50,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 18:32:50,667 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;@7a423628, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 18:32:50,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 18:32:50,944 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 18:32:50,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:32:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash -61934834, now seen corresponding path program 1 times [2023-11-17 18:32:50,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:32:50,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279186933] [2023-11-17 18:32:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:32:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:32:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:32:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 18:32:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:32:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279186933] [2023-11-17 18:32:51,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279186933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:32:51,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:32:51,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 18:32:51,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863887476] [2023-11-17 18:32:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:32:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 18:32:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:32:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 18:32:51,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 18:32:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:51,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:32:51,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 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 18:32:51,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:51,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 18:32:51,307 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 18:32:51,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:32:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2042831783, now seen corresponding path program 1 times [2023-11-17 18:32:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:32:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073138488] [2023-11-17 18:32:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:32:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:32:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:32:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:32:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:32:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073138488] [2023-11-17 18:32:51,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073138488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:32:51,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 18:32:51,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 18:32:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147418782] [2023-11-17 18:32:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:32:51,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 18:32:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:32:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 18:32:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 18:32:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:51,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:32:51,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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 18:32:51,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:51,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:32:51,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 18:32:51,947 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 18:32:51,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:32:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash -122193682, now seen corresponding path program 1 times [2023-11-17 18:32:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:32:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595480265] [2023-11-17 18:32:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:32:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:32:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:32:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:32:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:32:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595480265] [2023-11-17 18:32:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595480265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:32:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716931207] [2023-11-17 18:32:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:32:52,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:32:52,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:32:52,365 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 18:32:52,380 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 18:32:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:32:52,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 18:32:52,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:32:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:32:52,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:32:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:32:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716931207] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:32:52,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:32:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-11-17 18:32:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480293945] [2023-11-17 18:32:52,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:32:52,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 18:32:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:32:52,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 18:32:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-11-17 18:32:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:52,965 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:32:52,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.157894736842104) internal successors, (193), 19 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:32:52,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:52,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:32:52,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:32:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:32:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:32:53,200 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 18:32:53,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-17 18:32:53,400 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 18:32:53,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:32:53,401 INFO L85 PathProgramCache]: Analyzing trace with hash 461477685, now seen corresponding path program 2 times [2023-11-17 18:32:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:32:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51190694] [2023-11-17 18:32:53,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:32:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:32:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:32:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:32:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:32:57,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51190694] [2023-11-17 18:32:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51190694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:32:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575584252] [2023-11-17 18:32:57,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:32:57,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:32:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:32:57,003 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 18:32:57,031 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 18:32:57,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:32:57,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:32:57,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-17 18:32:57,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:32:58,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:32:58,391 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 42 treesize of output 31 [2023-11-17 18:32:58,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:32:58,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 24 [2023-11-17 18:32:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:32:59,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:33:01,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:01,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 97 [2023-11-17 18:33:01,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:01,300 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 57 treesize of output 51 [2023-11-17 18:33:01,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:01,311 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 51 treesize of output 45 [2023-11-17 18:33:01,376 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:01,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:01,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 1 [2023-11-17 18:33:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-17 18:33:02,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575584252] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:33:02,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:33:02,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 25] total 64 [2023-11-17 18:33:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699311388] [2023-11-17 18:33:02,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:33:02,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-17 18:33:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:33:02,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-17 18:33:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=3700, Unknown=6, NotChecked=0, Total=4032 [2023-11-17 18:33:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:02,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:33:02,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.8125) internal successors, (372), 64 states have internal predecessors, (372), 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 18:33:02,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:02,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:02,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:02,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:33:04,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 18:33:05,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:05,195 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 18:33:05,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:33:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1066458041, now seen corresponding path program 1 times [2023-11-17 18:33:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:33:05,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85932169] [2023-11-17 18:33:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:33:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:33:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:33:05,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85932169] [2023-11-17 18:33:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85932169] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:33:05,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253245204] [2023-11-17 18:33:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:05,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:33:05,509 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 18:33:05,527 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 18:33:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:05,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 18:33:05,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:33:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:33:05,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:33:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 18:33:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253245204] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:33:06,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:33:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2023-11-17 18:33:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562776180] [2023-11-17 18:33:06,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:33:06,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 18:33:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:33:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 18:33:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2023-11-17 18:33:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:06,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:33:06,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.033333333333333) internal successors, (301), 30 states have internal predecessors, (301), 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 18:33:06,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:06,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:06,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:06,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:33:06,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:33:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:33:06,495 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 18:33:06,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:06,689 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 18:33:06,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:33:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1655770930, now seen corresponding path program 2 times [2023-11-17 18:33:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:33:06,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285891288] [2023-11-17 18:33:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:33:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:33:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:33:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:33:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:33:12,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285891288] [2023-11-17 18:33:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285891288] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:33:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396783006] [2023-11-17 18:33:12,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:33:12,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:33:12,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:33:12,389 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 18:33:12,392 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 18:33:12,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:33:12,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:33:12,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 104 conjunts are in the unsatisfiable core [2023-11-17 18:33:12,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:33:12,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-17 18:33:12,593 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-17 18:33:12,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-17 18:33:12,656 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 18:33:12,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 18:33:13,048 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 18:33:13,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 18:33:13,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 18:33:14,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 18:33:14,679 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 18:33:15,341 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 32 treesize of output 25 [2023-11-17 18:33:18,474 INFO L349 Elim1Store]: treesize reduction 8, result has 84.3 percent of original size [2023-11-17 18:33:18,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 71 [2023-11-17 18:33:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:33:19,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:33:34,387 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod c_~sorted3~0 256) 0) (< |c_thread1Thread1of1ForFork2_#t~mem3| (+ |c_thread1Thread1of1ForFork2_#t~mem2| 1)) (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse8 4)) (.cse2 (+ c_~A~0.offset .cse8 8))) (and (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse1 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse0 (+ c_~A~0.offset .cse1 4)) (+ (select .cse0 (+ c_~A~0.offset .cse1)) 1))))) (< (select .cse0 .cse2) (+ (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse5 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse4 (+ c_~A~0.offset .cse5 4)))))) (< (select .cse4 .cse2) (+ (select .cse4 .cse3) 1))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse6 .cse3) (select .cse6 .cse2)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse7 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse6 (+ c_~A~0.offset .cse7 4)) (+ (select .cse6 (+ c_~A~0.offset .cse7)) 1))))))))))) (< (+ c_thread1Thread1of1ForFork2_~i~0 3) c_~N~0)) is different from false [2023-11-17 18:33:34,579 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (+ c_~A~0.offset .cse8 4))) (or (= (mod c_~sorted3~0 256) 0) (< (select (select |c_#memory_int| c_~A~0.base) .cse0) (+ |c_thread1Thread1of1ForFork2_#t~mem2| 1)) (let ((.cse3 (+ c_~A~0.offset .cse8 8))) (and (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse2 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse1 (+ c_~A~0.offset .cse2 4)) (+ (select .cse1 (+ c_~A~0.offset .cse2)) 1))))) (< (select .cse1 .cse3) (+ (select .cse1 .cse0) 1))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse5 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse4 (+ c_~A~0.offset .cse5 4)))))) (< (select .cse4 .cse3) (+ (select .cse4 .cse0) 1))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse6 .cse0) (select .cse6 .cse3)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse7 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse6 (+ c_~A~0.offset .cse7 4)) (+ (select .cse6 (+ c_~A~0.offset .cse7)) 1)))))))))) (< (+ c_thread1Thread1of1ForFork2_~i~0 3) c_~N~0)))) is different from false [2023-11-17 18:33:35,185 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse15 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset .cse15 8)) (.cse1 (+ c_~A~0.offset .cse15 4)) (.cse2 (+ c_~A~0.offset .cse15))) (and (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (let ((.cse0 (select .cse3 c_~A~0.base))) (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse4 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse4 c_~A~0.offset) (select .cse4 (+ c_~A~0.offset 4))) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse5 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse4 (+ c_~A~0.offset .cse5 4)) (+ (select .cse4 (+ c_~A~0.offset .cse5)) 1))))) (< (select .cse4 .cse6) (+ (select .cse4 .cse1) 1)))))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse7 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse7 .cse1) (select .cse7 .cse6)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse8 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse7 (+ c_~A~0.offset .cse8 4)) (+ (select .cse7 (+ c_~A~0.offset .cse8)) 1)))))))) (let ((.cse10 (select .cse9 c_~A~0.base))) (< (select .cse10 .cse1) (+ (select .cse10 .cse2) 1)))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse12 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse11 (+ c_~A~0.offset .cse12)) (select .cse11 (+ c_~A~0.offset .cse12 4)))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse11 .cse6) (+ (select .cse11 .cse1) 1))))) (let ((.cse14 (select .cse13 c_~A~0.base))) (< (select .cse14 .cse1) (+ (select .cse14 .cse2) 1))))))))) (= (mod c_~sorted3~0 256) 0) (< (+ c_thread1Thread1of1ForFork2_~i~0 3) c_~N~0)) is different from false [2023-11-17 18:33:37,861 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod c_~sorted3~0 256) 0) (= (mod c_~sorted1~0 256) 0) (let ((.cse3 (+ c_~A~0.offset 8)) (.cse2 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse1 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse0 (+ c_~A~0.offset .cse1 4)) (+ (select .cse0 (+ c_~A~0.offset .cse1)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse0 .cse2) (select .cse0 .cse3))))) (let ((.cse5 (select .cse4 c_~A~0.base))) (< (select .cse5 .cse2) (+ (select .cse5 c_~A~0.offset) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse6 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse7 (select .cse6 .cse2))) (or (< (select .cse6 c_~A~0.offset) .cse7) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse8 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse6 (+ c_~A~0.offset .cse8 4)) (+ (select .cse6 (+ c_~A~0.offset .cse8)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse6 .cse3) (+ .cse7 1)))))) (let ((.cse10 (select .cse9 c_~A~0.base))) (< (select .cse10 .cse2) (+ (select .cse10 c_~A~0.offset) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse12 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse11 (+ c_~A~0.offset .cse12)) (select .cse11 (+ c_~A~0.offset .cse12 4)))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse11 .cse3) (+ (select .cse11 .cse2) 1))))) (let ((.cse14 (select .cse13 c_~A~0.base))) (< (select .cse14 .cse2) (+ (select .cse14 c_~A~0.offset) 1))))))))) is different from false [2023-11-17 18:33:38,664 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod c_~sorted1~0 256) 0) (let ((.cse3 (+ c_~A~0.offset 8)) (.cse2 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse1 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse0 (+ c_~A~0.offset .cse1 4)) (+ (select .cse0 (+ c_~A~0.offset .cse1)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse0 .cse2) (select .cse0 .cse3))))) (let ((.cse5 (select .cse4 c_~A~0.base))) (< (select .cse5 .cse2) (+ (select .cse5 c_~A~0.offset) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse6 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse7 (select .cse6 .cse2))) (or (< (select .cse6 c_~A~0.offset) .cse7) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse8 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse6 (+ c_~A~0.offset .cse8 4)) (+ (select .cse6 (+ c_~A~0.offset .cse8)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse6 .cse3) (+ .cse7 1)))))) (let ((.cse10 (select .cse9 c_~A~0.base))) (< (select .cse10 .cse2) (+ (select .cse10 c_~A~0.offset) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse12 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse11 (+ c_~A~0.offset .cse12)) (select .cse11 (+ c_~A~0.offset .cse12 4)))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse11 .cse3) (+ (select .cse11 .cse2) 1))))) (let ((.cse14 (select .cse13 c_~A~0.base))) (< (select .cse14 .cse2) (+ (select .cse14 c_~A~0.offset) 1))))))))) is different from false [2023-11-17 18:33:38,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset 8)) (.cse2 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse1 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse0 (+ c_~A~0.offset .cse1 4)) (+ (select .cse0 (+ c_~A~0.offset .cse1)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse0 .cse2) (select .cse0 .cse3))))) (let ((.cse5 (select .cse4 c_~A~0.base))) (< (select .cse5 .cse2) (+ (select .cse5 c_~A~0.offset) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse6 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse7 (select .cse6 .cse2))) (or (< (select .cse6 c_~A~0.offset) .cse7) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse8 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse6 (+ c_~A~0.offset .cse8 4)) (+ (select .cse6 (+ c_~A~0.offset .cse8)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse6 .cse3) (+ .cse7 1)))))) (let ((.cse10 (select .cse9 c_~A~0.base))) (< (select .cse10 .cse2) (+ (select .cse10 c_~A~0.offset) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse12 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse11 (+ c_~A~0.offset .cse12)) (select .cse11 (+ c_~A~0.offset .cse12 4)))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse11 .cse3) (+ (select .cse11 .cse2) 1))))) (let ((.cse14 (select .cse13 c_~A~0.base))) (< (select .cse14 .cse2) (+ (select .cse14 c_~A~0.offset) 1)))))))) is different from false [2023-11-17 18:33:38,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~ret15#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_#t~ret15#1.offset| 4))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_#t~ret15#1.base|))) (< (select .cse0 .cse1) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret15#1.offset|) 1))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse3 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_#t~ret15#1.base|))) (or (< (select .cse3 .cse4) (+ (select .cse3 .cse1) 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse5 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_#t~ret15#1.offset|)) (select .cse3 (+ .cse5 |c_ULTIMATE.start_main_#t~ret15#1.offset| 4)))))))))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse6 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_#t~ret15#1.base|))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse7 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse6 (+ .cse7 |c_ULTIMATE.start_main_#t~ret15#1.offset| 4)) (+ (select .cse6 (+ .cse7 |c_ULTIMATE.start_main_#t~ret15#1.offset|)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse6 .cse1) (select .cse6 .cse4))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_#t~ret15#1.base|))) (< (select .cse9 .cse1) (+ (select .cse9 |c_ULTIMATE.start_main_#t~ret15#1.offset|) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse10 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_#t~ret15#1.base|))) (let ((.cse12 (select .cse10 .cse1))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse11 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse10 (+ .cse11 |c_ULTIMATE.start_main_#t~ret15#1.offset| 4)) (+ (select .cse10 (+ .cse11 |c_ULTIMATE.start_main_#t~ret15#1.offset|)) 1))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse10 .cse4) (+ .cse12 1)) (< (select .cse10 |c_ULTIMATE.start_main_#t~ret15#1.offset|) .cse12))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_#t~ret15#1.base|))) (< (select .cse14 .cse1) (+ (select .cse14 |c_ULTIMATE.start_main_#t~ret15#1.offset|) 1)))))))) is different from false [2023-11-17 18:33:39,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse0 .cse1) (select .cse0 .cse2)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse3 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse0 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (+ (select .cse0 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (select .cse5 .cse1) (+ (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse6 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse7 (select .cse6 .cse1))) (or (< (select .cse6 .cse2) (+ .cse7 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse8 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse6 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (+ (select .cse6 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (< (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse7))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (select .cse10 .cse1) (+ (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse11 .cse2) (+ (select .cse11 .cse1) 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse12 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse11 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse11 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))))))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (select .cse14 .cse1) (+ (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)))))))) is different from false [2023-11-17 18:33:39,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse3 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse0 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31)))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse5 .cse2) (+ (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse6 .cse2) (+ (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse8 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse9 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse8 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select .cse8 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (< (select .cse8 .cse2) (select .cse8 .cse1)))))))) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (let ((.cse10 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse10 .cse2) (+ (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse12 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse12 .cse2))) (or (< (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse13) (< (select .cse12 .cse1) (+ .cse13 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse14 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse12 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select .cse12 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))))))))))))) is different from false [2023-11-17 18:33:39,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:39,726 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 173 treesize of output 113 [2023-11-17 18:33:39,785 INFO L349 Elim1Store]: treesize reduction 21, result has 58.8 percent of original size [2023-11-17 18:33:39,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3344 treesize of output 3121 [2023-11-17 18:33:39,824 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:39,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:39,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:39,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:39,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 192 [2023-11-17 18:33:39,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:39,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:39,864 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:39,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:39,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 329 treesize of output 253 [2023-11-17 18:33:39,933 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-17 18:33:39,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 175 treesize of output 147 [2023-11-17 18:33:40,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:40,326 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 173 treesize of output 113 [2023-11-17 18:33:40,373 INFO L349 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2023-11-17 18:33:40,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1744 treesize of output 1619 [2023-11-17 18:33:40,409 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:33:40,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:33:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 166 [2023-11-17 18:33:40,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,424 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,424 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:33:40,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 245 [2023-11-17 18:33:40,459 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2023-11-17 18:33:40,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 175 treesize of output 129 [2023-11-17 18:33:40,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:33:40,591 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 230 treesize of output 146 [2023-11-17 18:33:40,620 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2023-11-17 18:33:40,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 617 treesize of output 576 [2023-11-17 18:33:40,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:33:40,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 18:33:40,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 18:33:40,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 485 treesize of output 377 [2023-11-17 18:33:40,694 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2023-11-17 18:33:40,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 436 treesize of output 378 [2023-11-17 18:33:40,739 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2023-11-17 18:33:40,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 200 treesize of output 175 [2023-11-17 18:33:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-11-17 18:33:42,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396783006] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:33:42,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:33:42,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 62, 60] total 163 [2023-11-17 18:33:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132734340] [2023-11-17 18:33:42,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:33:42,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 163 states [2023-11-17 18:33:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:33:42,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2023-11-17 18:33:42,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=22803, Unknown=64, NotChecked=2808, Total=26406 [2023-11-17 18:33:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:42,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:33:42,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 163 states, 163 states have (on average 3.1349693251533743) internal successors, (511), 163 states have internal predecessors, (511), 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 18:33:42,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:42,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:33:42,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:33:42,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:33:42,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:33:42,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:33:44,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse85 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse71 (+ .cse85 c_~A~0.offset 4)) (.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse66 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse88 (* (div c_~sorted1~0 256) 256)) (.cse86 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse73 (+ c_~A~0.offset .cse86)) (.cse58 (+ c_~A~0.offset .cse86 4)) (.cse53 (= (+ .cse88 1) c_~sorted1~0)) (.cse1 (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (let ((.cse89 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse5 (+ c_~A~0.offset .cse89 4)) (+ (select .cse5 (+ c_~A~0.offset .cse89)) 1))) (< .cse66 v_thread3Thread1of1ForFork1_~i~2_31)))) (.cse27 (= .cse88 c_~sorted1~0)) (.cse21 (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (let ((.cse87 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse5 (+ c_~A~0.offset .cse87)) (select .cse5 (+ c_~A~0.offset .cse87 4)))) (< .cse66 v_thread3Thread1of1ForFork1_~i~2_31)))) (.cse57 (+ c_~A~0.offset .cse86 8)) (.cse20 (select .cse5 .cse71))) (let ((.cse49 (< |c_thread2Thread1of1ForFork0_#t~mem6| .cse20)) (.cse63 (select .cse5 .cse57)) (.cse44 (or .cse27 .cse21)) (.cse48 (or .cse53 .cse1)) (.cse19 (+ .cse85 c_~A~0.offset)) (.cse33 (+ c_~A~0.offset 4)) (.cse9 (select .cse5 .cse58)) (.cse15 (select .cse5 .cse73))) (let ((.cse12 (< .cse9 (+ .cse15 1))) (.cse14 (and (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (let ((.cse72 (select .cse74 c_~A~0.base))) (< (select .cse72 .cse58) (+ (select .cse72 .cse73) 1))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse75 (select (store .cse74 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse75 c_~A~0.offset) (select .cse75 .cse33)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse76 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse75 (+ c_~A~0.offset .cse76 4)) (+ (select .cse75 (+ c_~A~0.offset .cse76)) 1))))) (< (select .cse75 .cse57) (+ (select .cse75 .cse58) 1)))))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse77 (select (store .cse79 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse77 .cse58) (select .cse77 .cse57)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse78 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse77 (+ c_~A~0.offset .cse78 4)) (+ (select .cse77 (+ c_~A~0.offset .cse78)) 1)))))))) (let ((.cse80 (select .cse79 c_~A~0.base))) (< (select .cse80 .cse58) (+ (select .cse80 .cse73) 1)))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse81 (select (store .cse83 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse82 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse81 (+ c_~A~0.offset .cse82)) (select .cse81 (+ c_~A~0.offset .cse82 4)))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse81 .cse57) (+ (select .cse81 .cse58) 1))))) (let ((.cse84 (select .cse83 c_~A~0.base))) (< (select .cse84 .cse58) (+ (select .cse84 .cse73) 1)))))))) (.cse24 (and (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (let ((.cse65 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse64 (+ c_~A~0.offset .cse65 4)) (+ (select .cse64 (+ c_~A~0.offset .cse65)) 1))) (< .cse66 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse64 .cse58) (select .cse64 .cse57))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (let ((.cse68 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse67 (+ c_~A~0.offset .cse68)) (select .cse67 (+ c_~A~0.offset .cse68 4)))) (< .cse66 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse67 .cse57) (+ (select .cse67 .cse58) 1))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse69 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (let ((.cse70 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse69 (+ c_~A~0.offset .cse70 4)) (+ (select .cse69 (+ c_~A~0.offset .cse70)) 1))) (< .cse66 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse69 .cse19) (select .cse69 .cse71)) (< (select .cse69 .cse57) (+ (select .cse69 .cse58) 1))))))) (.cse17 (and .cse44 .cse48)) (.cse16 (and (or .cse1 .cse27) .cse44)) (.cse22 (or .cse1 (< .cse9 .cse63))) (.cse18 (< .cse63 (+ .cse9 1))) (.cse7 (= (mod c_~sorted1~0 256) 0)) (.cse10 (+ |c_thread1Thread1of1ForFork2_#t~mem2| 1)) (.cse4 (and (or .cse49 .cse1) .cse21)) (.cse8 (< (+ c_thread1Thread1of1ForFork2_~i~0 2) c_~N~0)) (.cse23 (not |c_thread1Thread1of1ForFork2_#t~short4|)) (.cse11 (and (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse55 c_~A~0.offset) (select .cse55 .cse33)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse56 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse55 (+ c_~A~0.offset .cse56 4)) (+ (select .cse55 (+ c_~A~0.offset .cse56)) 1))))) (< (select .cse55 .cse57) (+ (select .cse55 .cse58) 1))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse60 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse59 (+ c_~A~0.offset .cse60)) (select .cse59 (+ c_~A~0.offset .cse60 4)))))) (< (select .cse59 .cse57) (+ (select .cse59 .cse58) 1))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (< (select .cse61 .cse58) (select .cse61 .cse57)) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse62 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse61 (+ c_~A~0.offset .cse62 4)) (+ (select .cse61 (+ c_~A~0.offset .cse62)) 1)))))))))) (.cse13 (< (+ c_thread1Thread1of1ForFork2_~i~0 3) c_~N~0)) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse25 (let ((.cse54 (= c_~sorted2~0 (* 256 (div c_~sorted2~0 256))))) (and (or .cse27 (and .cse53 (not .cse54))) (or (not .cse27) .cse54))))) (and (or .cse0 (let ((.cse6 (* |c_thread1Thread1of1ForFork2_#t~post1| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset 8 .cse6))) (.cse2 (select .cse5 (+ c_~A~0.offset .cse6 4)))) (and (or .cse1 (< .cse2 .cse3)) (or (< .cse3 (+ .cse2 1)) .cse4)))) (< (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) c_~N~0) .cse7) (or .cse0 .cse8 (and (or (< .cse9 .cse10) .cse4) (or (< |c_thread1Thread1of1ForFork2_#t~mem2| .cse9) .cse1))) (or .cse0 .cse11 .cse12 .cse13) (or .cse14 .cse0 .cse7 .cse13) (or (and (or .cse12 .cse4) (or .cse1 (< .cse15 .cse9))) .cse0 .cse8) (or .cse0 (and (or (< |c_thread2Thread1of1ForFork0_#t~mem6| |c_thread2Thread1of1ForFork0_#t~mem7|) .cse16) (or (< |c_thread2Thread1of1ForFork0_#t~mem7| (+ |c_thread2Thread1of1ForFork0_#t~mem6| 1)) .cse17))) (or (and (or .cse18 (and (or .cse1 (< (select .cse5 .cse19) .cse20)) .cse21)) .cse22) .cse0 .cse7 .cse13) (or .cse0 .cse23 .cse24 .cse13) (or .cse14 .cse0 .cse23 .cse13) (or .cse0 (and (or .cse25 (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_31) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (let ((.cse26 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse5 (+ c_~A~0.offset .cse26 4)) (+ (select .cse5 (+ c_~A~0.offset .cse26)) 1)))))) (or .cse27 (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_31) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (let ((.cse28 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse5 (+ c_~A~0.offset .cse28)) (select .cse5 (+ c_~A~0.offset .cse28 4))))))))) (or .cse0 .cse24 .cse7 .cse13) (or .cse0 (let ((.cse32 (+ c_~A~0.offset 8))) (and (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse29 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse30 (select .cse29 .cse33))) (or (< (select .cse29 c_~A~0.offset) .cse30) (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse31 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse29 (+ c_~A~0.offset .cse31 4)) (+ (select .cse29 (+ c_~A~0.offset .cse31)) 1))))) (< (select .cse29 .cse32) (+ .cse30 1)))))) (let ((.cse35 (select .cse34 c_~A~0.base))) (< (select .cse35 .cse33) (+ 1 (select .cse35 c_~A~0.offset))))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse36 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (let ((.cse37 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse36 (+ c_~A~0.offset .cse37)) (select .cse36 (+ c_~A~0.offset .cse37 4)))) (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31))) (< (select .cse36 .cse32) (+ (select .cse36 .cse33) 1))))) (let ((.cse39 (select .cse38 c_~A~0.base))) (< (select .cse39 .cse33) (+ 1 (select .cse39 c_~A~0.offset))))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse40 (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse41 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse40 (+ c_~A~0.offset .cse41 4)) (+ (select .cse40 (+ c_~A~0.offset .cse41)) 1))))) (< (select .cse40 .cse33) (select .cse40 .cse32))))) (let ((.cse43 (select .cse42 c_~A~0.base))) (< (select .cse43 .cse33) (+ 1 (select .cse43 c_~A~0.offset))))))))) .cse7) (or .cse0 (and (or .cse17 (not |c_thread2Thread1of1ForFork0_#t~short8|)) (or |c_thread2Thread1of1ForFork0_#t~short8| .cse16))) (or .cse0 (and .cse22 (or .cse18 .cse4)) .cse7 .cse13) (or .cse0 (and .cse44 (or .cse25 .cse1))) (or .cse0 (< (+ 2 c_thread3Thread1of1ForFork1_~i~2) c_~N~0) (let ((.cse47 (* c_thread3Thread1of1ForFork1_~i~2 4))) (let ((.cse46 (select .cse5 (+ c_~A~0.offset 4 .cse47))) (.cse45 (select .cse5 (+ c_~A~0.offset .cse47)))) (and (or .cse27 (< .cse45 .cse46)) (or .cse25 (< .cse46 (+ .cse45 1))))))) (or .cse0 (and (or .cse23 .cse4) (or .cse1 |c_thread1Thread1of1ForFork2_#t~short4|)) .cse8) (or .cse0 (and (or .cse1 (< |c_thread1Thread1of1ForFork2_#t~mem2| |c_thread1Thread1of1ForFork2_#t~mem3|)) (or (< |c_thread1Thread1of1ForFork2_#t~mem3| .cse10) .cse4)) .cse8) (or .cse0 .cse23 .cse11 .cse13) (or .cse0 (and .cse44 .cse48 (or .cse49 .cse1 .cse27))) (or .cse0 (let ((.cse50 (+ |c_thread2Thread1of1ForFork0_#t~post5| 1))) (and (or .cse25 (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< .cse50 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse51 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse5 (+ c_~A~0.offset .cse51 4)) (+ (select .cse5 (+ c_~A~0.offset .cse51)) 1)))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_31 Int)) (or (< (+ 2 v_thread3Thread1of1ForFork1_~i~2_31) c_~N~0) (< .cse50 v_thread3Thread1of1ForFork1_~i~2_31) (let ((.cse52 (* v_thread3Thread1of1ForFork1_~i~2_31 4))) (< (select .cse5 (+ c_~A~0.offset .cse52)) (select .cse5 (+ c_~A~0.offset .cse52 4)))))) .cse27)))))))))) is different from false [2023-11-17 18:34:33,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 18:34:35,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 18:34:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:34:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:34:43,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:34:43,323 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 18:34:43,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:43,517 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 18:34:43,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:34:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 218797141, now seen corresponding path program 3 times [2023-11-17 18:34:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:34:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702528370] [2023-11-17 18:34:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:34:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:34:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:34:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 31 proven. 42 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-17 18:34:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:34:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702528370] [2023-11-17 18:34:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702528370] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:34:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911960922] [2023-11-17 18:34:43,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:34:43,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:43,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:34:43,989 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 18:34:44,017 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 18:34:44,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-17 18:34:44,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:34:44,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-17 18:34:44,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:34:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:34:44,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:34:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 29 proven. 55 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-17 18:34:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911960922] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:34:45,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:34:45,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 44 [2023-11-17 18:34:45,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104166079] [2023-11-17 18:34:45,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:34:45,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-17 18:34:45,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:34:45,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-17 18:34:45,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2023-11-17 18:34:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:45,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:34:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 9.659090909090908) internal successors, (425), 44 states have internal predecessors, (425), 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 18:34:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:34:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:34:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:34:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:34:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:34:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:34:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:34:46,435 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 18:34:46,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:46,631 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 18:34:46,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:34:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1483159349, now seen corresponding path program 4 times [2023-11-17 18:34:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:34:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064636461] [2023-11-17 18:34:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:34:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:34:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:34:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 66 proven. 77 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-17 18:34:47,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:34:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064636461] [2023-11-17 18:34:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064636461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:34:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144674474] [2023-11-17 18:34:47,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 18:34:47,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:47,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:34:47,169 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 18:34:47,187 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 18:34:47,296 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 18:34:47,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:34:47,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-17 18:34:47,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:34:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 91 proven. 52 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-17 18:34:47,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:34:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 91 proven. 52 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-17 18:34:48,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144674474] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:34:48,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:34:48,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 50 [2023-11-17 18:34:48,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013713029] [2023-11-17 18:34:48,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:34:48,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-17 18:34:48,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:34:48,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-17 18:34:48,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=2042, Unknown=0, NotChecked=0, Total=2450 [2023-11-17 18:34:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:48,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:34:48,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 8.1) internal successors, (405), 50 states have internal predecessors, (405), 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 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:34:48,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:34:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:34:48,793 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 18:34:48,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:48,991 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 18:34:48,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:34:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1982050364, now seen corresponding path program 5 times [2023-11-17 18:34:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:34:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190164161] [2023-11-17 18:34:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:34:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:34:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:34:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 18:34:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:34:57,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190164161] [2023-11-17 18:34:57,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190164161] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:34:57,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926695180] [2023-11-17 18:34:57,286 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 18:34:57,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:34:57,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:34:57,288 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 18:34:57,289 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 18:34:57,501 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-17 18:34:57,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:34:57,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-17 18:34:57,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:35:02,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:35:02,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 28 [2023-11-17 18:35:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 18:35:02,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:35:07,290 INFO L349 Elim1Store]: treesize reduction 25, result has 71.9 percent of original size [2023-11-17 18:35:07,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 140 treesize of output 96 [2023-11-17 18:35:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-17 18:35:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926695180] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:35:08,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:35:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 56, 43] total 152 [2023-11-17 18:35:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870197937] [2023-11-17 18:35:08,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:35:08,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2023-11-17 18:35:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:35:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2023-11-17 18:35:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=22255, Unknown=0, NotChecked=0, Total=22952 [2023-11-17 18:35:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:08,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:35:08,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 4.2894736842105265) internal successors, (652), 152 states have internal predecessors, (652), 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 18:35:08,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2023-11-17 18:35:33,556 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 18:35:33,750 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,SelfDestructingSolverStorable8 [2023-11-17 18:35:33,751 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 18:35:33,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:35:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 283661146, now seen corresponding path program 1 times [2023-11-17 18:35:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:35:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997059111] [2023-11-17 18:35:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:35:33,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:35:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:35:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 267 proven. 175 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-17 18:35:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:35:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997059111] [2023-11-17 18:35:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997059111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:35:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583755143] [2023-11-17 18:35:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:35:34,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:35:34,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:35:34,688 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 18:35:34,712 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 18:35:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:35:34,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 18:35:34,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:35:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 316 proven. 126 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-17 18:35:35,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:35:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 316 proven. 126 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-17 18:35:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583755143] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:35:36,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:35:36,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 70 [2023-11-17 18:35:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745776972] [2023-11-17 18:35:36,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:35:36,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-17 18:35:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:35:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-17 18:35:36,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=4082, Unknown=0, NotChecked=0, Total=4830 [2023-11-17 18:35:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:36,385 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:35:36,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 7.242857142857143) internal successors, (507), 70 states have internal predecessors, (507), 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 18:35:36,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:36,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:36,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:36,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:36,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2023-11-17 18:35:36,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2023-11-17 18:35:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:35:37,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-17 18:35:37,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 18:35:37,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 18:35:37,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:35:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -390039565, now seen corresponding path program 2 times [2023-11-17 18:35:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:35:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840833378] [2023-11-17 18:35:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:35:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:35:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:35:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 127 proven. 168 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-11-17 18:35:38,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:35:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840833378] [2023-11-17 18:35:38,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840833378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:35:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433259354] [2023-11-17 18:35:38,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 18:35:38,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:35:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:35:38,268 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 18:35:38,299 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 18:35:38,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 18:35:38,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:35:38,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 18:35:38,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:35:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 336 proven. 175 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-17 18:35:39,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:35:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 336 proven. 175 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-17 18:35:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433259354] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:35:40,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:35:40,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 33] total 92 [2023-11-17 18:35:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945657865] [2023-11-17 18:35:40,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:35:40,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2023-11-17 18:35:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:35:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2023-11-17 18:35:40,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=7579, Unknown=0, NotChecked=0, Total=8372 [2023-11-17 18:35:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:40,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:35:40,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 7.271739130434782) internal successors, (669), 92 states have internal predecessors, (669), 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 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:35:40,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:35:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:35:43,997 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 18:35:44,192 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,SelfDestructingSolverStorable10 [2023-11-17 18:35:44,192 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 18:35:44,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:35:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash -829857423, now seen corresponding path program 3 times [2023-11-17 18:35:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:35:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652579030] [2023-11-17 18:35:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:35:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:35:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:35:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 169 proven. 236 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-11-17 18:35:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:35:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652579030] [2023-11-17 18:35:45,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652579030] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:35:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504672441] [2023-11-17 18:35:45,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 18:35:45,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:35:45,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:35:45,338 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:35:45,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 18:35:45,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 18:35:45,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:35:45,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-17 18:35:45,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:35:46,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:35:46,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2023-11-17 18:35:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 152 proven. 45 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2023-11-17 18:35:47,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:35:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 139 proven. 58 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2023-11-17 18:35:50,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504672441] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:35:50,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:35:50,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 32] total 94 [2023-11-17 18:35:50,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426134288] [2023-11-17 18:35:50,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:35:50,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-11-17 18:35:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:35:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-11-17 18:35:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=8280, Unknown=0, NotChecked=0, Total=8742 [2023-11-17 18:35:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:50,364 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:35:50,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 6.138297872340425) internal successors, (577), 94 states have internal predecessors, (577), 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 18:35:50,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:50,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:50,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:50,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:50,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:50,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:50,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:50,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:50,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:35:50,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:35:50,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:35:50,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-11-17 18:35:59,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 18:35:59,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-17 18:35:59,936 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 18:35:59,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:35:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 535440854, now seen corresponding path program 4 times [2023-11-17 18:35:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:35:59,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253492254] [2023-11-17 18:35:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:35:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:35:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:36:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 355 proven. 302 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-11-17 18:36:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:36:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253492254] [2023-11-17 18:36:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253492254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:36:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810868156] [2023-11-17 18:36:00,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 18:36:00,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:36:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:36:00,972 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:36:00,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 18:36:01,117 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 18:36:01,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:36:01,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 18:36:01,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:36:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 425 proven. 232 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-11-17 18:36:02,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:36:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 425 proven. 232 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-11-17 18:36:03,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810868156] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:36:03,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:36:03,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 90 [2023-11-17 18:36:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627710353] [2023-11-17 18:36:03,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:36:03,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-11-17 18:36:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:36:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-11-17 18:36:03,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=6818, Unknown=0, NotChecked=0, Total=8010 [2023-11-17 18:36:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:03,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:36:03,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 6.633333333333334) internal successors, (597), 90 states have internal predecessors, (597), 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 18:36:03,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:03,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-11-17 18:36:03,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-11-17 18:36:04,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:36:04,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 18:36:04,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 18:36:04,548 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 18:36:04,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:36:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -456366097, now seen corresponding path program 5 times [2023-11-17 18:36:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:36:04,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000886171] [2023-11-17 18:36:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:36:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:36:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:36:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 222 proven. 317 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2023-11-17 18:36:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:36:05,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000886171] [2023-11-17 18:36:05,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000886171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:36:05,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417486160] [2023-11-17 18:36:05,725 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 18:36:05,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:36:05,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:36:05,729 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:36:05,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 18:36:05,899 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-17 18:36:05,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:36:05,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 18:36:05,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:36:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2023-11-17 18:36:06,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 18:36:06,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417486160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 18:36:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 18:36:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [39] total 42 [2023-11-17 18:36:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361739664] [2023-11-17 18:36:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 18:36:06,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 18:36:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:36:06,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 18:36:06,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1550, Unknown=0, NotChecked=0, Total=1722 [2023-11-17 18:36:06,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:06,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:36:06,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 18:36:06,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:06,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:06,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:06,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:36:06,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:36:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-11-17 18:36:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:36:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 18:36:06,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 18:36:06,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 18:36:06,316 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 18:36:06,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 18:36:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1891426993, now seen corresponding path program 6 times [2023-11-17 18:36:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 18:36:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863200197] [2023-11-17 18:36:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 18:36:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 18:36:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 18:36:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 203 proven. 362 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-11-17 18:36:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 18:36:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863200197] [2023-11-17 18:36:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863200197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 18:36:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297455072] [2023-11-17 18:36:07,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 18:36:07,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:36:07,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 18:36:07,294 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 18:36:07,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 18:36:07,778 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-17 18:36:07,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 18:36:07,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-17 18:36:07,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 18:36:09,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 18:36:09,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 50 [2023-11-17 18:36:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 169 proven. 213 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-17 18:36:10,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 18:36:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 148 proven. 147 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2023-11-17 18:36:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297455072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 18:36:12,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 18:36:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51, 35] total 112 [2023-11-17 18:36:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162233885] [2023-11-17 18:36:12,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 18:36:12,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2023-11-17 18:36:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 18:36:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2023-11-17 18:36:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=11823, Unknown=0, NotChecked=0, Total=12432 [2023-11-17 18:36:12,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:12,678 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 18:36:12,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 5.794642857142857) internal successors, (649), 112 states have internal predecessors, (649), 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 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 18:36:12,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 18:36:18,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:21,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:22,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:23,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:24,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:27,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:29,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:30,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:32,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:35,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:36,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:40,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:41,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:43,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:45,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:48,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:49,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:51,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:55,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:36:57,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:00,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:02,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:05,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:09,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:12,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:16,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:17,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:21,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:25,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:29,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:32,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:34,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:36,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:37,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:39,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:41,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:44,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:47,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:50,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:54,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:56,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:37:58,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:00,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:02,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:05,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:07,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:09,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:11,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:17,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:18,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:19,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:21,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:23,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:25,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:27,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:28,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:34,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:37,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:44,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:47,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:51,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:53,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:55,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:38:59,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:04,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:08,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:11,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:13,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:15,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:17,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:23,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:25,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:27,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:29,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:31,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:37,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:39,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:41,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:43,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:47,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:49,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:39:57,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:01,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:02,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:04,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:09,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:11,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:13,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:15,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:18,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:20,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:23,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:27,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:31,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:33,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:38,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:42,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:44,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:46,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:51,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:40:55,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:01,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:05,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:09,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:11,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:16,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:20,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:22,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:25,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:29,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 18:41:32,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-11-17 18:41:36,822 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 18:41:36,822 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 18:41:36,822 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 18:41:36,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-17 18:41:37,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 18:41:37,069 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 220 known predicates. [2023-11-17 18:41:37,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 18:41:37,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 18:41:37,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 18:41:37,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 18:41:37,075 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 2, 1, 1] [2023-11-17 18:41:37,078 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 18:41:37,078 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 18:41:37,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:41:37 BasicIcfg [2023-11-17 18:41:37,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 18:41:37,081 INFO L158 Benchmark]: Toolchain (without parser) took 527393.55ms. Allocated memory was 203.4MB in the beginning and 755.0MB in the end (delta: 551.6MB). Free memory was 159.5MB in the beginning and 224.5MB in the end (delta: -65.0MB). Peak memory consumption was 487.6MB. Max. memory is 8.0GB. [2023-11-17 18:41:37,081 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 18:41:37,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.79ms. Allocated memory is still 203.4MB. Free memory was 159.5MB in the beginning and 147.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 18:41:37,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 203.4MB. Free memory was 147.6MB in the beginning and 145.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 18:41:37,082 INFO L158 Benchmark]: Boogie Preprocessor took 29.95ms. Allocated memory is still 203.4MB. Free memory was 145.8MB in the beginning and 144.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 18:41:37,082 INFO L158 Benchmark]: RCFGBuilder took 463.62ms. Allocated memory is still 203.4MB. Free memory was 144.1MB in the beginning and 126.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-11-17 18:41:37,082 INFO L158 Benchmark]: TraceAbstraction took 526659.59ms. Allocated memory was 203.4MB in the beginning and 755.0MB in the end (delta: 551.6MB). Free memory was 125.3MB in the beginning and 224.5MB in the end (delta: -99.2MB). Peak memory consumption was 453.0MB. Max. memory is 8.0GB. [2023-11-17 18:41:37,083 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.79ms. Allocated memory is still 203.4MB. Free memory was 159.5MB in the beginning and 147.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 203.4MB. Free memory was 147.6MB in the beginning and 145.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.95ms. Allocated memory is still 203.4MB. Free memory was 145.8MB in the beginning and 144.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 463.62ms. Allocated memory is still 203.4MB. Free memory was 144.1MB in the beginning and 126.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 526659.59ms. Allocated memory was 203.4MB in the beginning and 755.0MB in the end (delta: 551.6MB). Free memory was 125.3MB in the beginning and 224.5MB in the end (delta: -99.2MB). Peak memory consumption was 453.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20394, independent: 19139, independent conditional: 15050, independent unconditional: 4089, dependent: 1255, dependent conditional: 1241, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19163, independent: 19139, independent conditional: 15050, independent unconditional: 4089, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19163, independent: 19139, independent conditional: 15050, independent unconditional: 4089, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19249, independent: 19139, independent conditional: 22, independent unconditional: 19117, dependent: 110, dependent conditional: 64, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19249, independent: 19139, independent conditional: 22, independent unconditional: 19117, dependent: 110, dependent conditional: 49, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19249, independent: 19139, independent conditional: 22, independent unconditional: 19117, dependent: 110, dependent conditional: 49, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3394, independent: 3370, independent conditional: 3, independent unconditional: 3367, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3394, independent: 3365, independent conditional: 0, independent unconditional: 3365, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 65, independent conditional: 8, independent unconditional: 57, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19249, independent: 15769, independent conditional: 19, independent unconditional: 15750, dependent: 86, dependent conditional: 39, dependent unconditional: 47, unknown: 3394, unknown conditional: 13, unknown unconditional: 3381] , Statistics on independence cache: Total cache size (in pairs): 3394, Positive cache size: 3370, Positive conditional cache size: 3, Positive unconditional cache size: 3367, Negative cache size: 24, Negative conditional cache size: 10, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 7, Independence queries for same thread: 1231 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 175, Number of trivial persistent sets: 125, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4103, independent: 4089, independent conditional: 0, independent unconditional: 4089, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20394, independent: 19139, independent conditional: 15050, independent unconditional: 4089, dependent: 1255, dependent conditional: 1241, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19163, independent: 19139, independent conditional: 15050, independent unconditional: 4089, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19163, independent: 19139, independent conditional: 15050, independent unconditional: 4089, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19249, independent: 19139, independent conditional: 22, independent unconditional: 19117, dependent: 110, dependent conditional: 64, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19249, independent: 19139, independent conditional: 22, independent unconditional: 19117, dependent: 110, dependent conditional: 49, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19249, independent: 19139, independent conditional: 22, independent unconditional: 19117, dependent: 110, dependent conditional: 49, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3394, independent: 3370, independent conditional: 3, independent unconditional: 3367, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3394, independent: 3365, independent conditional: 0, independent unconditional: 3365, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 24, dependent conditional: 10, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 65, independent conditional: 8, independent unconditional: 57, dependent: 57, dependent conditional: 22, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19249, independent: 15769, independent conditional: 19, independent unconditional: 15750, dependent: 86, dependent conditional: 39, dependent unconditional: 47, unknown: 3394, unknown conditional: 13, unknown unconditional: 3381] , Statistics on independence cache: Total cache size (in pairs): 3394, Positive cache size: 3370, Positive conditional cache size: 3, Positive unconditional cache size: 3367, Negative cache size: 24, Negative conditional cache size: 10, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 7, Independence queries for same thread: 1231 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 220 known predicates. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 220 known predicates. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 220 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 220 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 236 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 526.4s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 429.8s, 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: 773, 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.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 90.1s InterpolantComputationTime, 7372 NumberOfCodeBlocks, 6836 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 10491 ConstructedInterpolants, 126 QuantifiedInterpolants, 108229 SizeOfPredicates, 386 NumberOfNonLiveVariables, 5811 ConjunctsInSsa, 534 ConjunctsInUnsatCore, 40 InterpolantComputations, 3 PerfectInterpolantSequences, 9856/13941 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