/usr/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/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line295.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:57:26,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:57:26,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:57:26,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:57:26,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:57:26,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:57:26,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:57:26,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:57:26,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:57:26,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:57:26,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:57:26,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:57:26,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:57:26,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:57:26,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:57:26,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:57:26,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:57:26,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:57:26,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:57:26,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:57:26,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:57:26,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:57:26,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:57:26,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:57:26,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:57:26,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:57:26,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:57:26,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:57:26,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:57:26,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:57:26,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:57:26,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:57:26,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:57:26,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:57:26,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:57:26,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:57:26,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:57:26,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:57:26,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:57:26,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:57:26,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:57:26,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:57:26,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:57:26,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:57:26,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:57:26,206 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:57:26,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:57:26,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:57:26,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:57:26,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:57:26,207 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:57:26,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:57:26,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:57:26,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:57:26,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:57:26,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:57:26,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:57:26,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:57:26,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:57:26,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:57:26,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:57:26,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:57:26,211 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:57:26,212 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:57:26,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:57:26,212 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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 [2022-10-04 00:57:26,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:57:26,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:57:26,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:57:26,453 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:57:26,453 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:57:26,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line295.bpl [2022-10-04 00:57:26,455 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line295.bpl' [2022-10-04 00:57:26,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:57:26,518 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:57:26,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:57:26,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:57:26,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:57:26,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:57:26,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:57:26,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:57:26,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:57:26,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/1) ... [2022-10-04 00:57:26,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:57:26,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:26,653 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) [2022-10-04 00:57:26,655 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 [2022-10-04 00:57:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:57:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:57:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:57:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:57:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:57:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:57:26,685 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:57:26,825 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:57:26,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:57:27,426 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:57:27,445 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:57:27,445 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:57:27,447 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:57:27 BoogieIcfgContainer [2022-10-04 00:57:27,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:57:27,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:57:27,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:57:27,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:57:27,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:57:26" (1/2) ... [2022-10-04 00:57:27,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5add310c and model type queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:57:27, skipping insertion in model container [2022-10-04 00:57:27,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:57:27" (2/2) ... [2022-10-04 00:57:27,457 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.line295.bpl [2022-10-04 00:57:27,464 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:57:27,473 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:57:27,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:57:27,474 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:57:27,578 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:57:27,620 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:27,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:27,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:27,623 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) [2022-10-04 00:57:27,632 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 [2022-10-04 00:57:27,663 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:27,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:57:27,674 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:27,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:57:27,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:57:27,791 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:57:27,793 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:57:27,814 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:27,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:27,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:27,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:57:27,827 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:27,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:57:27,828 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:27,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:57:27,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-04 00:57:28,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:57:28,169 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:57:28,174 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:57:28,181 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:28,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:28,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:28,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:57:28,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-04 00:57:28,221 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:28,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:57:28,222 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:28,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:57:28,222 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:57:28,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:57:28,223 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:57:28,223 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:57:28,233 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:57:28,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:57:28,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:28,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-04 00:57:28,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-04 00:57:28,241 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:57:28,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:57:28,243 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9e789a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:57:28,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:57:28,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:57:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:57:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash -944447742, now seen corresponding path program 1 times [2022-10-04 00:57:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:57:28,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525892234] [2022-10-04 00:57:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:57:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:28,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:57:28,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525892234] [2022-10-04 00:57:28,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525892234] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:57:28,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:57:28,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:57:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445473112] [2022-10-04 00:57:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:57:28,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:57:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:57:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:57:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:57:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:28,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:57:28,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 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) [2022-10-04 00:57:28,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:28,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:57:28,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:57:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:57:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash -484467378, now seen corresponding path program 1 times [2022-10-04 00:57:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:57:28,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271990768] [2022-10-04 00:57:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:57:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:33,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:57:33,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271990768] [2022-10-04 00:57:33,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271990768] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:57:33,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:57:33,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-10-04 00:57:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038171612] [2022-10-04 00:57:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:57:33,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-04 00:57:33,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:57:33,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-04 00:57:33,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2022-10-04 00:57:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:33,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:57:33,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 6.545454545454546) internal successors, (216), 34 states have internal predecessors, (216), 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) [2022-10-04 00:57:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:33,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:57:49,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:57:49,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:57:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:57:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash 981294747, now seen corresponding path program 1 times [2022-10-04 00:57:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:57:49,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899962615] [2022-10-04 00:57:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:57:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:57:50,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899962615] [2022-10-04 00:57:50,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899962615] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:57:50,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560649904] [2022-10-04 00:57:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:50,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:57:50,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:50,432 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) [2022-10-04 00:57:50,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-04 00:57:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:50,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 95 conjunts are in the unsatisfiable core [2022-10-04 00:57:50,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:57:50,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:57:51,024 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:57:51,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-04 00:57:51,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-04 00:57:51,747 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:57:51,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-10-04 00:57:51,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:57:51,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:57:52,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-10-04 00:57:52,982 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:57:52,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-10-04 00:57:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:57:53,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:57:53,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-04 00:57:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:53,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:57:53,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560649904] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:57:53,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:57:53,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [23] total 57 [2022-10-04 00:57:53,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841104876] [2022-10-04 00:57:53,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:57:53,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-04 00:57:53,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:57:53,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-04 00:57:53,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3001, Unknown=0, NotChecked=0, Total=3192 [2022-10-04 00:57:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:53,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:57:53,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.485714285714286) internal successors, (297), 35 states have internal predecessors, (297), 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) [2022-10-04 00:57:53,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:53,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:57:53,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:57:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:57:57,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 00:57:57,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:57:57,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:57:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:57:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1444466288, now seen corresponding path program 1 times [2022-10-04 00:57:57,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:57:57,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076094123] [2022-10-04 00:57:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:57:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:57:59,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076094123] [2022-10-04 00:57:59,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076094123] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:57:59,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783187102] [2022-10-04 00:57:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:59,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:57:59,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:59,256 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) [2022-10-04 00:57:59,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-04 00:57:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:59,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 125 conjunts are in the unsatisfiable core [2022-10-04 00:57:59,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:57:59,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:57:59,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 00:57:59,834 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:57:59,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-10-04 00:57:59,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-04 00:58:00,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-04 00:58:00,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:00,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:58:00,939 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:58:00,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-10-04 00:58:00,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-04 00:58:02,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:58:02,300 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:58:02,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-10-04 00:58:02,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:02,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 00:58:03,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:58:03,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:58:03,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-04 00:58:04,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:58:04,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-10-04 00:58:04,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 00:58:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:58:04,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:58:05,237 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))) is different from false [2022-10-04 00:58:05,266 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-10-04 00:58:05,295 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4))))))) is different from false [2022-10-04 00:58:05,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:05,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-10-04 00:58:05,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:05,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 45 [2022-10-04 00:58:05,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-04 00:58:05,420 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:05,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-10-04 00:58:05,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:58:05,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2022-10-04 00:58:06,981 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|))))) is different from false [2022-10-04 00:58:07,646 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|))))) is different from false [2022-10-04 00:58:15,581 WARN L233 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:58:22,196 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:58:29,435 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:58:49,670 WARN L233 SmtUtils]: Spent 15.94s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:59:06,403 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:59:20,815 WARN L233 SmtUtils]: Spent 11.07s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:59:37,265 WARN L233 SmtUtils]: Spent 11.60s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:00:07,140 WARN L233 SmtUtils]: Spent 19.42s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:00:24,294 WARN L233 SmtUtils]: Spent 16.96s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:00:36,635 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:00:46,829 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:00:55,195 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:01:04,249 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:01:15,958 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:01:20,428 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-04 01:01:20,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 90 treesize of output 68 [2022-10-04 01:01:20,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:01:20,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 105 [2022-10-04 01:01:20,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:20,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-10-04 01:01:20,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 01:01:20,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:20,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:01:20,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 81 [2022-10-04 01:01:20,667 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-10-04 01:01:20,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 88 treesize of output 56 [2022-10-04 01:01:20,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:20,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-10-04 01:01:20,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:20,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-10-04 01:01:35,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-10-04 01:01:35,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:01:35,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-10-04 01:01:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:01:35,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783187102] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:01:35,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:01:35,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46, 48] total 134 [2022-10-04 01:01:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86960970] [2022-10-04 01:01:35,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:01:35,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-10-04 01:01:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:01:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-10-04 01:01:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=16119, Unknown=51, NotChecked=1300, Total=18090 [2022-10-04 01:01:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:35,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:01:35,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 135 states, 134 states have (on average 5.895522388059701) internal successors, (790), 135 states have internal predecessors, (790), 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) [2022-10-04 01:01:35,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:35,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-04 01:01:35,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-10-04 01:01:35,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:41,540 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) (.cse7 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (= (select .cse9 3204) 0)) (.cse4 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 0) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_~#queue~0.base|) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= 0 |c_~#queue~0.offset|) .cse1 (or (and (forall ((v_ArrVal_157 Int) (v_ArrVal_162 Int) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse2 (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_157)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_159) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ 7 (* 4 (select (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| v_ArrVal_160) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) .cse3)) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|))))) .cse4 (forall ((v_ArrVal_157 Int) (v_ArrVal_162 Int) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse5 (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_157)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_159) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (<= 0 (+ (* 4 (select (store (store .cse5 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| v_ArrVal_160) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) .cse6)) |c_~#queue~0.offset| 4)))))) (< .cse7 (+ 3212 |c_~#queue~0.offset|))) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse0)) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= 3204 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= 3212 .cse7) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and .cse1 (not .cse8)) (and .cse8 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 3204)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 3204) 0)))) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= 0 (+ |c_~#queue~0.offset| 4)) .cse4) (forall ((v_ArrVal_154 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_154) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|) 3204) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|) 3204) 0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_ULTIMATE.start_empty_~q#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-10-04 01:01:45,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (<= .cse5 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse9) 0)) (.cse3 (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse9) 0)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse2) .cse0) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) .cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= 0 |c_~#queue~0.offset|) (<= 0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse4 3204) |c_t1Thread1of1ForFork1_read~int_#value#1|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_~#queue~0.offset| 0) .cse3 (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 3212 .cse5) (<= (+ |c_t1Thread1of1ForFork1_write~int_#sizeOfWrittenType#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse4 .cse6)) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and (= (select .cse7 3204) 0) (not .cse8)) (and .cse8 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 3204)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 3204) 0)))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 3204) 0) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse2 (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_162)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse6) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_162)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= |c_~#stored_elements~0.base| 6) (= (select .cse7 .cse9) 0)))) is different from false [2022-10-04 01:01:46,297 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 0) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:01:47,016 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-10-04 01:01:47,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (select .cse2 3204))) (and (<= (+ 3208 (* .cse0 4)) .cse1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= (+ 3212 |c_~#queue~0.offset|) .cse1) (<= 1 .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (= 7 |c_~#queue~0.base|) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 01:01:47,791 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 3204)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (+ 3208 (* .cse1 4)) .cse2) (<= 0 |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)))) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (<= 1 .cse1) (<= (+ 3212 |c_~#queue~0.offset|) .cse2) (= 7 |c_~#queue~0.base|) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 01:01:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:01:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 01:01:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 01:01:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-10-04 01:01:48,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-04 01:01:48,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:01:48,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:01:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:01:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1770284473, now seen corresponding path program 1 times [2022-10-04 01:01:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:01:48,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128255115] [2022-10-04 01:01:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:01:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:01:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:01:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 01:01:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:01:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128255115] [2022-10-04 01:01:49,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128255115] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:01:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934765045] [2022-10-04 01:01:49,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:01:49,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:01:49,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:01:49,460 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) [2022-10-04 01:01:49,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-04 01:01:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:01:49,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 164 conjunts are in the unsatisfiable core [2022-10-04 01:01:49,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:01:49,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 01:01:49,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 01:01:50,054 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 01:01:50,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-10-04 01:01:50,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-04 01:01:50,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-04 01:01:50,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:01:50,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 01:01:51,288 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 01:01:51,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-10-04 01:01:51,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-04 01:01:52,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:52,346 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 01:01:52,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-10-04 01:01:52,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:01:52,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 32 [2022-10-04 01:01:53,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:53,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-10-04 01:01:53,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-10-04 01:01:53,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:01:53,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-10-04 01:01:54,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:54,485 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 01:01:54,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-10-04 01:01:54,684 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 01:01:54,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-10-04 01:01:54,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:01:54,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-04 01:01:55,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:01:55,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-04 01:01:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:01:55,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:02:15,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:02:15,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-10-04 01:02:15,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:02:15,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 81 [2022-10-04 01:02:15,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-10-04 01:02:15,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 01:02:15,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:02:16,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 54 [2022-10-04 01:03:19,383 WARN L233 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:03:24,281 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-04 01:03:24,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 37 treesize of output 40 [2022-10-04 01:03:24,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:03:24,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 50 [2022-10-04 01:03:24,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-10-04 01:03:24,364 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-10-04 01:03:24,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 31 [2022-10-04 01:03:24,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:03:24,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-10-04 01:03:25,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-10-04 01:03:25,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:03:25,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-10-04 01:03:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:03:25,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934765045] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:03:25,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:03:25,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 54, 53] total 124 [2022-10-04 01:03:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113407351] [2022-10-04 01:03:25,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:03:25,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-10-04 01:03:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:03:25,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-10-04 01:03:25,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=14492, Unknown=116, NotChecked=0, Total=15252 [2022-10-04 01:03:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:03:25,764 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:03:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 7.911290322580645) internal successors, (981), 124 states have internal predecessors, (981), 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) [2022-10-04 01:03:25,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:03:25,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-04 01:03:25,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-10-04 01:03:25,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-10-04 01:03:25,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:03:30,075 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse3))) (and (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3204))) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= 3212 .cse1) (<= (+ 3208 |c_~#queue~0.offset|) |c_ULTIMATE.start_write~int_#ptr#1.offset|) (or .cse2 (forall ((v_ArrVal_237 Int)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)))) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (+ 3212 (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (+ .cse1 |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_21| Int)) (or (not (<= (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21|)) (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799))))) .cse3 (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_21| Int)) (or (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3200)) (not (<= (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21|)))))) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 0) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) (or .cse2 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))))))))) is different from false [2022-10-04 01:03:33,494 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse3 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse1 (<= .cse6 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse7)) (.cse8 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse5))) (and (not (= .cse0 800)) (or .cse1 (and .cse2 .cse3)) (or (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse4) 0) .cse3) .cse1) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) .cse2 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)) (not (= 800 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| v_ArrVal_253) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (and (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (< (* (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3200)) (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (not (= (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799))) .cse5) (< .cse6 (+ 3212 |c_~#queue~0.offset|))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= 3212 .cse6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse7)) (= .cse7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (or .cse8 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 0))))) (or .cse8 (forall ((v_ArrVal_237 Int)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)))) (not (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse4) 0) (or .cse8 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))))))))) is different from false [2022-10-04 01:03:34,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (or (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (<= .cse0 4)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)) (not (= 800 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| v_ArrVal_253) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:03:38,862 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) 3204) 1) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 3212 .cse0) (= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 3204) 1) (= (select (select |c_#memory_int| 7) .cse1) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| Int) (v_ArrVal_251 Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| v_ArrVal_251) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse1) 1))) is different from false [2022-10-04 01:03:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:03:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 01:03:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 01:03:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-10-04 01:03:39,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-10-04 01:03:39,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-04 01:03:39,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:03:39,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:03:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:03:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 252233874, now seen corresponding path program 2 times [2022-10-04 01:03:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:03:39,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122384629] [2022-10-04 01:03:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:03:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:03:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:03:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:03:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:03:42,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122384629] [2022-10-04 01:03:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122384629] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:03:42,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824789258] [2022-10-04 01:03:42,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:03:42,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:03:42,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:03:42,662 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) [2022-10-04 01:03:42,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-04 01:03:42,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 01:03:42,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:03:42,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 230 conjunts are in the unsatisfiable core [2022-10-04 01:03:42,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:03:43,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-10-04 01:03:43,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-04 01:03:43,741 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 01:03:43,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-04 01:03:44,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-10-04 01:03:46,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-10-04 01:03:47,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-10-04 01:03:57,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:03:57,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-10-04 01:04:03,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2022-10-04 01:04:29,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-10-04 01:05:16,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-10-04 01:05:19,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-10-04 01:05:22,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:05:22,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 39 [2022-10-04 01:05:33,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:05:33,559 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 01:05:33,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 48 [2022-10-04 01:05:36,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:05:36,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-10-04 01:05:41,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:05:41,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-10-04 01:05:47,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-10-04 01:05:48,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:05:48,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 39 [2022-10-04 01:05:49,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-10-04 01:05:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 132 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:05:50,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:05:51,138 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))) (forall ((v_ArrVal_346 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|)))) is different from false [2022-10-04 01:05:51,170 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_346 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-10-04 01:05:51,194 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_346 (Array Int Int))) (< (+ (* 4 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204))) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-10-04 01:05:51,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:05:51,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-10-04 01:05:51,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:05:51,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2022-10-04 01:05:51,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-10-04 01:05:51,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:05:51,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-10-04 01:05:51,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:05:51,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2022-10-04 01:06:14,968 WARN L233 SmtUtils]: Spent 19.39s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:06:25,523 WARN L233 SmtUtils]: Spent 10.28s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:06:39,487 WARN L233 SmtUtils]: Spent 13.74s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:06:40,277 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (let ((.cse1 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (= 800 (select (store .cse1 .cse0 v_ArrVal_343) .cse2)))))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_339 (Array Int Int))) (or (not (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_343 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* 4 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_343)) .cse4)))))))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((v_ArrVal_339 (Array Int Int))) (or (not (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_343 Int)) (let ((.cse5 (let ((.cse7 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse6 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_343)) .cse7)))) (or (< (+ 7 |c_~#queue~0.offset| (* 4 .cse5)) (select |c_#length| |c_~#queue~0.base|)) (= 800 .cse5)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 01:06:40,363 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((v_ArrVal_339 (Array Int Int))) (or (forall ((v_ArrVal_343 Int)) (let ((.cse0 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_343)) .cse2)))) (or (< (+ 7 |c_~#queue~0.offset| (* 4 .cse0)) (select |c_#length| |c_~#queue~0.base|)) (= 800 .cse0)))) (not (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_339 (Array Int Int))) (or (forall ((v_ArrVal_343 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_343)) .cse4))) 4))) (not (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))))) (or (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (let ((.cse5 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse7) 4)))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (= 800 (select (store .cse5 .cse6 v_ArrVal_343) .cse7)) (not (<= 0 .cse6)))))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 01:06:40,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:40,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 59 [2022-10-04 01:06:40,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:40,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 104 [2022-10-04 01:06:40,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2022-10-04 01:06:40,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 01:06:40,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:40,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 129 treesize of output 105 [2022-10-04 01:06:40,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:40,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 89 [2022-10-04 01:06:40,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:40,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-10-04 01:06:40,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 93 [2022-10-04 01:06:40,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-04 01:06:41,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:41,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 473 treesize of output 345 [2022-10-04 01:06:44,442 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int) (v_ArrVal_336 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (= (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (and (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (or (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (forall ((v_ArrVal_336 Int)) (let ((.cse1 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (let ((.cse2 (* .cse1 4))) (or (= .cse1 800) (= .cse1 799) (< (+ .cse2 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ .cse2 |c_~#queue~0.offset| 4) 0))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0))) is different from false [2022-10-04 01:06:45,171 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int) (v_ArrVal_336 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (= 800 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (forall ((v_ArrVal_336 Int)) (let ((.cse0 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (let ((.cse1 (* .cse0 4))) (or (= .cse0 799) (= 800 .cse0) (< (+ .cse1 |c_~#queue~0.offset| 4) 0) (< (+ .cse1 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) (or .cse2 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse2))) is different from false [2022-10-04 01:07:03,867 WARN L233 SmtUtils]: Spent 18.31s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:07:21,001 WARN L233 SmtUtils]: Spent 16.85s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:07:37,902 WARN L233 SmtUtils]: Spent 15.68s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:08:15,744 WARN L233 SmtUtils]: Spent 35.06s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:08:48,776 WARN L233 SmtUtils]: Spent 29.04s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:09:13,750 WARN L233 SmtUtils]: Spent 20.58s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:09:44,373 WARN L233 SmtUtils]: Spent 24.58s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:10:22,949 WARN L233 SmtUtils]: Spent 27.00s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:10:46,230 WARN L233 SmtUtils]: Spent 22.87s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:11:01,493 WARN L233 SmtUtils]: Spent 9.65s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:11:10,759 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:11:17,070 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:11:30,265 WARN L233 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-10-04 01:11:35,970 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:11:35,973 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 [2022-10-04 01:11:35,973 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:11:35,973 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:11:35,973 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 [2022-10-04 01:11:35,973 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-04 01:11:37,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-10-04 01:11:37,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2022-10-04 01:11:37,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-10-04 01:11:37,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2022-10-04 01:11:37,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-04 01:11:37,176 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-10-04 01:11:37,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-10-04 01:11:37,282 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-10-04 01:11:37,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-04 01:11:37,283 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-10-04 01:11:37,284 INFO L158 Benchmark]: Toolchain (without parser) took 850766.00ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 141.2MB in the beginning and 135.0MB in the end (delta: 6.2MB). Peak memory consumption was 271.9MB. Max. memory is 8.0GB. [2022-10-04 01:11:37,285 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 01:11:37,285 INFO L158 Benchmark]: Boogie Preprocessor took 87.10ms. Allocated memory is still 188.7MB. Free memory was 141.2MB in the beginning and 137.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-04 01:11:37,285 INFO L158 Benchmark]: RCFGBuilder took 839.38ms. Allocated memory is still 188.7MB. Free memory was 137.8MB in the beginning and 138.9MB in the end (delta: -1.1MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2022-10-04 01:11:37,285 INFO L158 Benchmark]: TraceAbstraction took 849835.42ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 138.3MB in the beginning and 135.0MB in the end (delta: 3.3MB). Peak memory consumption was 268.0MB. Max. memory is 8.0GB. [2022-10-04 01:11:37,286 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 87.10ms. Allocated memory is still 188.7MB. Free memory was 141.2MB in the beginning and 137.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 839.38ms. Allocated memory is still 188.7MB. Free memory was 137.8MB in the beginning and 138.9MB in the end (delta: -1.1MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. * TraceAbstraction took 849835.42ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 138.3MB in the beginning and 135.0MB in the end (delta: 3.3MB). Peak memory consumption was 268.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1688, positive: 1674, positive conditional: 0, positive unconditional: 1674, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1651, positive: 1637, positive conditional: 0, positive unconditional: 1637, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1688, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1651, unknown conditional: 0, unknown unconditional: 1651] , Statistics on independence cache: Total cache size (in pairs): 1651, Positive cache size: 1637, Positive conditional cache size: 0, Positive unconditional cache size: 1637, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 80, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown