/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/divinefifo_1w1r.line1234.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 22:27:24,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 22:27:24,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 22:27:24,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 22:27:24,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 22:27:24,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 22:27:24,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 22:27:24,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 22:27:24,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 22:27:24,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 22:27:24,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 22:27:24,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 22:27:24,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 22:27:24,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 22:27:24,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 22:27:24,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 22:27:24,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 22:27:24,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 22:27:24,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 22:27:24,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 22:27:24,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 22:27:24,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 22:27:24,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 22:27:24,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 22:27:24,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 22:27:24,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 22:27:24,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 22:27:24,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 22:27:24,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 22:27:24,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 22:27:24,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 22:27:24,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 22:27:24,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 22:27:24,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 22:27:24,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 22:27:24,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 22:27:24,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 22:27:24,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 22:27:24,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 22:27:24,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 22:27:24,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 22:27:24,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 22:27:24,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 22:27:24,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 22:27:24,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 22:27:24,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 22:27:24,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 22:27:24,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 22:27:24,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 22:27:24,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 22:27:24,412 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 22:27:24,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 22:27:24,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 22:27:24,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 22:27:24,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 22:27:24,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 22:27:24,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 22:27:24,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 22:27:24,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 22:27:24,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 22:27:24,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 22:27:24,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 22:27:24,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 22:27:24,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 22:27:24,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 22:27:24,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 22:27:24,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 22:27:24,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:27:24,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 22:27:24,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 22:27:24,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 22:27:24,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 22:27:24,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 22:27:24,416 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 22:27:24,416 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 22:27:24,417 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 22:27:24,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 22:27:24,417 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 22:27:24,417 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 22:27:24,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 22:27:24,417 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-09-29 22:27:24,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 22:27:24,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 22:27:24,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 22:27:24,649 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 22:27:24,654 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 22:27:24,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1234.bpl [2022-09-29 22:27:24,656 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1234.bpl' [2022-09-29 22:27:24,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 22:27:24,737 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 22:27:24,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 22:27:24,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 22:27:24,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 22:27:24,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 22:27:24,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 22:27:24,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 22:27:24,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 22:27:24,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/1) ... [2022-09-29 22:27:24,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:27:24,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:27:24,930 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-09-29 22:27:24,940 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-09-29 22:27:24,962 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 22:27:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 22:27:24,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 22:27:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 22:27:24,964 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 22:27:25,097 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 22:27:25,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 22:27:26,182 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 22:27:26,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 22:27:26,210 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 22:27:26,213 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:27:26 BoogieIcfgContainer [2022-09-29 22:27:26,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 22:27:26,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 22:27:26,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 22:27:26,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 22:27:26,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:27:24" (1/2) ... [2022-09-29 22:27:26,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1756cecb and model type divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 10:27:26, skipping insertion in model container [2022-09-29 22:27:26,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:27:26" (2/2) ... [2022-09-29 22:27:26,224 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1234.bpl [2022-09-29 22:27:26,231 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 22:27:26,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 22:27:26,244 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 22:27:26,244 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 22:27:26,425 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 22:27:26,507 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 22:27:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 22:27:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:27:26,510 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-09-29 22:27:26,517 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-09-29 22:27:26,542 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 22:27:26,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 22:27:26,555 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;@74536304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 22:27:26,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 22:27:26,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:27:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:27:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1437579302, now seen corresponding path program 1 times [2022-09-29 22:27:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:27:26,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658017527] [2022-09-29 22:27:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:27:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:27:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:27:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:27:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:27:27,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658017527] [2022-09-29 22:27:27,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658017527] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:27:27,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:27:27,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 22:27:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781770592] [2022-09-29 22:27:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:27:27,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 22:27:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:27:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 22:27:27,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 22:27:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:27,500 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:27:27,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 226.5) internal successors, (453), 2 states have internal predecessors, (453), 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-09-29 22:27:27,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:27,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 22:27:27,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:27:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:27:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062876, now seen corresponding path program 1 times [2022-09-29 22:27:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:27:27,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450943719] [2022-09-29 22:27:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:27:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:27:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:27:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:27:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:27:28,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450943719] [2022-09-29 22:27:28,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450943719] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:27:28,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:27:28,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-29 22:27:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943114606] [2022-09-29 22:27:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:27:28,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-29 22:27:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:27:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-29 22:27:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-09-29 22:27:28,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:28,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:27:28,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 47.27272727272727) internal successors, (520), 12 states have internal predecessors, (520), 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-09-29 22:27:28,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:28,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:27:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 22:27:29,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:27:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:27:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2047773636, now seen corresponding path program 1 times [2022-09-29 22:27:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:27:29,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205131340] [2022-09-29 22:27:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:27:29,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:27:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:27:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:27:31,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:27:31,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205131340] [2022-09-29 22:27:31,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205131340] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:27:31,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831693695] [2022-09-29 22:27:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:27:31,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:27:31,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:27:31,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:27:31,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-29 22:27:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:27:32,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 2005 conjuncts, 162 conjunts are in the unsatisfiable core [2022-09-29 22:27:32,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:27:34,544 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-09-29 22:27:34,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 40 [2022-09-29 22:27:34,557 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-29 22:27:34,558 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 24 treesize of output 32 [2022-09-29 22:27:34,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-09-29 22:27:35,344 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2022-09-29 22:27:36,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:27:36,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 13 [2022-09-29 22:27:36,290 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-09-29 22:27:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:27:36,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:27:36,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831693695] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:27:36,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:27:36,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [48] total 93 [2022-09-29 22:27:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247477063] [2022-09-29 22:27:36,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:27:36,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-09-29 22:27:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:27:36,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-09-29 22:27:36,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=8266, Unknown=0, NotChecked=0, Total=8556 [2022-09-29 22:27:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:36,403 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:27:36,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 17.52173913043478) internal successors, (806), 46 states have internal predecessors, (806), 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-09-29 22:27:36,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:36,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:27:36,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:27:45,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:27:45,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-29 22:27:45,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-09-29 22:27:45,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:27:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:27:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash -551293358, now seen corresponding path program 1 times [2022-09-29 22:27:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:27:45,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069414531] [2022-09-29 22:27:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:27:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:27:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:27:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:27:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:27:49,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069414531] [2022-09-29 22:27:49,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069414531] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:27:49,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871872206] [2022-09-29 22:27:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:27:49,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:27:49,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:27:49,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:27:49,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-29 22:27:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:27:50,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 2108 conjuncts, 168 conjunts are in the unsatisfiable core [2022-09-29 22:27:50,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:27:53,303 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-09-29 22:27:53,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 40 [2022-09-29 22:27:53,314 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-29 22:27:53,315 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 26 treesize of output 36 [2022-09-29 22:27:53,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-09-29 22:27:54,303 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-09-29 22:27:55,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:27:55,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 13 [2022-09-29 22:27:55,530 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-09-29 22:27:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:27:55,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:27:55,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871872206] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:27:55,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:27:55,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [75] total 126 [2022-09-29 22:27:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80947215] [2022-09-29 22:27:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:27:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-09-29 22:27:55,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:27:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-09-29 22:27:55,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=15336, Unknown=0, NotChecked=0, Total=15750 [2022-09-29 22:27:55,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:55,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:27:55,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 16.0188679245283) internal successors, (849), 53 states have internal predecessors, (849), 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-09-29 22:27:55,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:27:55,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:27:55,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:27:55,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:28:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:28:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:28:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:28:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-09-29 22:28:04,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-29 22:28:05,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:28:05,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:28:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:28:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1987551730, now seen corresponding path program 1 times [2022-09-29 22:28:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:28:05,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035096051] [2022-09-29 22:28:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:28:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:28:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:28:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-09-29 22:28:08,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:28:08,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035096051] [2022-09-29 22:28:08,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035096051] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:28:08,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915294769] [2022-09-29 22:28:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:28:08,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:28:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:28:08,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:28:08,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-29 22:28:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:28:09,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 273 conjunts are in the unsatisfiable core [2022-09-29 22:28:09,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:28:10,402 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 11 treesize of output 7 [2022-09-29 22:28:11,812 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-09-29 22:28:12,189 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:28:12,189 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 29 treesize of output 31 [2022-09-29 22:28:12,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:28:12,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-29 22:28:18,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:28:18,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2022-09-29 22:28:20,838 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:28:20,838 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-09-29 22:28:22,674 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-29 22:28:22,674 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 33 treesize of output 32 [2022-09-29 22:28:24,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:28:24,656 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-09-29 22:28:24,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2022-09-29 22:28:25,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:28:25,720 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 26 treesize of output 12 [2022-09-29 22:28:26,473 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-09-29 22:28:26,703 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-09-29 22:28:26,707 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 12 [2022-09-29 22:28:28,569 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-09-29 22:28:29,163 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 26 treesize of output 14 [2022-09-29 22:28:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:28:29,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:28:30,345 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 34 [2022-09-29 22:28:32,533 INFO L356 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-09-29 22:28:32,533 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 2 case distinctions, treesize of input 20 treesize of output 21 [2022-09-29 22:28:32,561 INFO L356 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2022-09-29 22:28:32,563 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 2 case distinctions, treesize of input 20 treesize of output 26 [2022-09-29 22:28:33,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:28:33,506 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 66 treesize of output 82 [2022-09-29 22:28:35,549 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))) is different from false [2022-09-29 22:28:57,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) |c_ULTIMATE.start_fifo_drop_head_#t~mem35#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))) is different from false [2022-09-29 22:28:57,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) is different from false [2022-09-29 22:28:57,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) is different from false [2022-09-29 22:29:48,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_615))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-09-29 22:29:48,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_615))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-09-29 22:29:48,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_615))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-09-29 22:29:48,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_615))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-09-29 22:29:48,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_615))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-09-29 22:29:48,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_615))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-09-29 22:30:04,779 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 20 [2022-09-29 22:30:04,806 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int)) (or (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse3 .cse1))) (store (store .cse2 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse4)) .cse4 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse1)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (select .cse8 .cse6))) (store (store .cse7 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse9)) .cse9 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse6)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| (+ 8 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-09-29 22:30:04,926 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse3 .cse1))) (store (store .cse2 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse4)) .cse4 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse1)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (or (< 0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse5 (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse9 (select .cse8 .cse6))) (store (store .cse7 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse9)) .cse9 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse5 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse6)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-09-29 22:30:09,360 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-09-29 22:30:09,361 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 414 treesize of output 314 [2022-09-29 22:30:09,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:30:09,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 310 treesize of output 308 [2022-09-29 22:30:09,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:30:09,400 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 212 treesize of output 196 [2022-09-29 22:30:09,406 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 195 treesize of output 183 [2022-09-29 22:30:09,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:30:09,419 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 193 treesize of output 185 [2022-09-29 22:30:09,602 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-09-29 22:30:09,634 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 8 treesize of output 4 [2022-09-29 22:30:09,650 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:30:09,651 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 21 treesize of output 25 [2022-09-29 22:30:09,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:30:09,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 159 [2022-09-29 22:30:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:30:12,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915294769] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-29 22:30:12,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-29 22:30:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 100, 94] total 263 [2022-09-29 22:30:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160881574] [2022-09-29 22:30:12,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-29 22:30:12,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 263 states [2022-09-29 22:30:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:30:12,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 263 interpolants. [2022-09-29 22:30:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=61626, Unknown=217, NotChecked=6108, Total=68906 [2022-09-29 22:30:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:30:12,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:30:12,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 263 states, 263 states have (on average 10.034220532319392) internal successors, (2639), 263 states have internal predecessors, (2639), 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-09-29 22:30:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:30:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:30:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:30:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-09-29 22:30:12,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:30:29,922 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse27 (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse16 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_init_~self#1.base|))) (let ((.cse9 (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse15 |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse6 (select .cse10 .cse16)) (.cse13 (= .cse27 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse7 (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse21 (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|)) (.cse0 (select .cse10 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse3 (and .cse1 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_~self#1.base|))) (.cse4 (= (select |c_#valid| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) 1)) (.cse5 (+ |c_ULTIMATE.start_fifo_node_init_~self#1.offset| 4)) (.cse17 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (<= (+ |c_ULTIMATE.start_write~$Pointer$_#value#1.base| 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) .cse1 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (or .cse3 (and .cse1 .cse4 (<= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_node_init_~self#1.offset|) .cse5))) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse6 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) .cse7 (or (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select .cse8 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) 4) .cse9 (= .cse10 .cse11) (= .cse8 .cse12) (= (select |c_#valid| .cse0) 1))) .cse13) .cse9 (<= (+ 2 |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (let ((.cse14 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_init_~self#1.base|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (select .cse14 |c_ULTIMATE.start_fifo_init_~self#1.offset|)) 4) .cse1 (= .cse12 .cse14) (= (select |c_#valid| .cse2) 1) (= .cse15 .cse11))) .cse13) (= .cse16 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (= .cse6 .cse17) (= (select |c_#valid| |c_ULTIMATE.start_fifo_empty_~self#1.base|) 1) (or (and (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) .cse1) (and .cse1 (= (select |c_#valid| |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) 1))) (= .cse6 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base|) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (or .cse13 (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse19 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (= .cse11 .cse18) (= .cse12 .cse19) (= (select |c_#valid| .cse20) 1) (<= (select (select |c_#memory_$Pointer$.offset| .cse20) (select .cse19 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) 4))))) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_ULTIMATE.start_fifo_init_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse21 (or (and (= |c_ULTIMATE.start_write~$Pointer$_#value#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (and (= (select |c_#valid| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|) 1) .cse1 .cse7 .cse21 (<= (select (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|) |c_ULTIMATE.start_write~$Pointer$_#value#1.offset|) 4))) (or (and .cse1 (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) 1)) (and .cse1 (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_node_init_#in~self#1.offset| 0) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse23 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse22 (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse26 (select .cse25 .cse23))) (store (store .cse24 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse25 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse26)) .cse26 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse22 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse22 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse23)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_node_init_~self#1.offset| 0) (<= (+ .cse27 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.offset| 0) (or .cse3 (and .cse1 .cse4 (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_node_init_~self#1.offset|) .cse5))) (= (select |c_#valid| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) 1) (or (< 0 .cse16) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse29 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse28 (select (let ((.cse30 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse32 (select .cse31 .cse29))) (store (store .cse30 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse31 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse32)) .cse32 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse28 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse28 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse29)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse17) (= (select |c_#valid| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|))))) is different from false [2022-09-29 22:30:29,971 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (or (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse0 (select .cse2 |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select .cse1 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= .cse2 .cse3) (= .cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= (select |c_#valid| .cse0) 1))) (= .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= (select .cse2 .cse5) (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse6 (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse10 (select .cse9 .cse7))) (store (store .cse8 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse10)) .cse10 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse6 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse7)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse5) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse12 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse11 (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse15 (select .cse14 .cse12))) (store (store .cse13 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse14 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse15)) .cse15 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse11 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse12)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-09-29 22:30:29,976 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse2 (select .cse4 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse2) (select .cse3 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) 4) (= .cse4 .cse5) (= (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) .cse3) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 .cse8))) (store (store .cse9 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse11)) .cse11 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse7 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse8)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse6 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse1) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse13 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse16 (select .cse15 .cse13))) (store (store .cse14 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse15 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse16)) .cse16 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse12 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse13)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-09-29 22:30:29,981 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (select .cse5 .cse3))) (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse6)) .cse6 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse3)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse7 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse1) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|))))) (or (= .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) (and (= .cse7 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) 1))))) is different from false [2022-09-29 22:30:29,985 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (or (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) (= .cse0 |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) 1) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#t~mem6#1.base|) |c_ULTIMATE.start_fifo_empty_#t~mem6#1.offset|) 4))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse1 .cse2) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (select .cse6 .cse4))) (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) .cse7 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse4)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse2) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-09-29 22:30:29,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (and (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (= .cse2 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (select .cse6 .cse4))) (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) .cse7 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse4)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse1) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-09-29 22:30:30,001 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (or (and (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse1 .cse2) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (select .cse6 .cse4))) (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) .cse7 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse4)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse2) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-09-29 22:30:30,007 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (or (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset|) (= (select |c_#valid| .cse0) 1) (<= |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset| 4)) (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse1 .cse2) (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (select .cse6 .cse4))) (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) .cse7 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse4)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse2) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|))))))) is different from false [2022-09-29 22:30:30,014 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 .cse2)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (or (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset|) (= (select |c_#valid| .cse0) 1) (<= |c_ULTIMATE.start_fifo_empty_#t~mem8#1.offset| 4)) (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (select .cse6 .cse4))) (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) .cse7 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse4)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse2) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-09-29 22:30:30,025 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 .cse2)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (or (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (and (= (select |c_#valid| .cse0) 1) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4))) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (select .cse6 .cse4))) (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) .cse7 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse4)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse2) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-09-29 22:30:30,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 .cse2)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (or (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| .cse0) 1)) (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (select .cse6 .cse4))) (store (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse7)) .cse7 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse4)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse2) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse12 (select .cse11 .cse9))) (store (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse12)) .cse12 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse9)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-09-29 22:30:30,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#q~1#1.base|) 1) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int)) (or (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (select .cse5 .cse3))) (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse6)) .cse6 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse3)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (or (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| .cse0) 1)) (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|)) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 .cse8))) (store (store .cse9 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse11)) .cse11 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse7 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse8)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| (+ 8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-09-29 22:30:30,053 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (= .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (forall ((|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int)) (or (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse2 (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (select .cse5 .cse3))) (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse6)) .cse6 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse3)))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse7 (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_612))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse11 (select .cse10 .cse8))) (store (store .cse9 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse11)) .cse11 v_ArrVal_615)))) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select (store .cse7 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616) .cse8)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (< |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| (+ 8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) (or (= .cse0 |c_ULTIMATE.start_main_~#q~1#1.base|) (and (not (= .cse0 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) 4)))))) is different from false [2022-09-29 22:31:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:31:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:31:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:31:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-09-29 22:31:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-09-29 22:31:54,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-09-29 22:31:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:31:54,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:31:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:31:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash -437340102, now seen corresponding path program 2 times [2022-09-29 22:31:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:31:54,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130879915] [2022-09-29 22:31:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:31:54,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:31:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:31:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-09-29 22:31:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:31:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130879915] [2022-09-29 22:31:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130879915] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:31:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835053017] [2022-09-29 22:31:58,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-29 22:31:58,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:31:58,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:31:58,819 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-09-29 22:31:58,820 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-09-29 22:31:59,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-29 22:31:59,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-29 22:31:59,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 190 conjunts are in the unsatisfiable core [2022-09-29 22:31:59,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:32:00,246 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-09-29 22:32:00,255 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-09-29 22:32:00,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:00,860 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-09-29 22:32:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:00,870 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-09-29 22:32:01,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:01,098 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-09-29 22:32:01,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:01,104 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 25 treesize of output 24 [2022-09-29 22:32:03,325 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-09-29 22:32:03,884 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-09-29 22:32:03,884 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 65 [2022-09-29 22:32:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:03,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:03,903 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:32:03,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 44 [2022-09-29 22:32:03,916 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 27 treesize of output 23 [2022-09-29 22:32:03,947 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 73 treesize of output 61 [2022-09-29 22:32:07,538 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:32:07,538 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 96 treesize of output 94 [2022-09-29 22:32:09,067 INFO L356 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2022-09-29 22:32:09,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 50 [2022-09-29 22:32:09,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:09,077 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-09-29 22:32:09,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-09-29 22:32:09,390 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 11 treesize of output 7 [2022-09-29 22:32:09,395 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 11 treesize of output 7 [2022-09-29 22:32:09,619 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-09-29 22:32:09,621 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-09-29 22:32:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-09-29 22:32:09,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:32:09,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835053017] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:32:09,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:32:09,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [78] total 130 [2022-09-29 22:32:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577732341] [2022-09-29 22:32:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:32:09,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-29 22:32:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:32:09,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-29 22:32:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=16355, Unknown=0, NotChecked=0, Total=16770 [2022-09-29 22:32:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:32:09,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:32:09,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 17.77777777777778) internal successors, (960), 54 states have internal predecessors, (960), 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-09-29 22:32:09,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:32:09,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:32:09,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:32:09,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-09-29 22:32:09,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-09-29 22:32:09,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:32:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:32:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:32:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:32:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-09-29 22:32:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-09-29 22:32:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:32:21,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-29 22:32:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:32:21,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:32:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:32:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1964932028, now seen corresponding path program 3 times [2022-09-29 22:32:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:32:21,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311286476] [2022-09-29 22:32:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:32:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:32:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:32:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:32:25,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:32:25,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311286476] [2022-09-29 22:32:25,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311286476] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:32:25,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35670830] [2022-09-29 22:32:25,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-29 22:32:25,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:32:25,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:32:25,280 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-09-29 22:32:25,281 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-09-29 22:32:25,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-09-29 22:32:25,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-29 22:32:25,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 181 conjunts are in the unsatisfiable core [2022-09-29 22:32:25,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:32:26,852 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-29 22:32:27,277 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-09-29 22:32:27,278 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 1 case distinctions, treesize of input 21 treesize of output 24 [2022-09-29 22:32:27,283 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-29 22:32:28,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:28,125 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 30 treesize of output 32 [2022-09-29 22:32:28,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:28,129 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 30 treesize of output 30 [2022-09-29 22:32:28,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:28,429 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-09-29 22:32:28,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-09-29 22:32:28,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:28,448 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 47 treesize of output 46 [2022-09-29 22:32:31,541 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-09-29 22:32:32,295 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-09-29 22:32:32,296 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 66 [2022-09-29 22:32:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:32,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:32,311 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:32:32,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 52 [2022-09-29 22:32:32,317 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 5 treesize of output 3 [2022-09-29 22:32:32,345 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 50 treesize of output 38 [2022-09-29 22:32:37,556 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:32:37,556 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 131 treesize of output 129 [2022-09-29 22:32:39,812 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-09-29 22:32:39,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 56 [2022-09-29 22:32:39,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:32:39,821 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-09-29 22:32:39,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 27 [2022-09-29 22:32:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-09-29 22:32:40,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:32:40,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35670830] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:32:40,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:32:40,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [74] total 127 [2022-09-29 22:32:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669765211] [2022-09-29 22:32:40,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:32:40,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-09-29 22:32:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:32:40,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-09-29 22:32:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=15563, Unknown=0, NotChecked=0, Total=16002 [2022-09-29 22:32:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:32:40,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:32:40,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 17.454545454545453) internal successors, (960), 55 states have internal predecessors, (960), 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-09-29 22:32:40,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:32:40,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-09-29 22:32:40,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-09-29 22:32:40,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-09-29 22:32:40,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-09-29 22:32:40,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:32:40,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:33:06,645 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_615))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select (select (store .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))) (and .cse0 (or (not (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (= (select .cse1 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (select .cse1 (+ 4 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))))) .cse0 (< (select |c_#length| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|) (+ 8 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|))))) is different from false [2022-09-29 22:33:40,601 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_615))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))) is different from false [2022-09-29 22:33:41,047 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_615))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base| (store .cse1 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1)) is different from false [2022-09-29 22:34:49,021 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (forall ((v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store .cse0 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)))))) is different from false [2022-09-29 22:34:49,503 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (forall ((v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))))) is different from false [2022-09-29 22:34:49,982 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) 1) (forall ((v_ArrVal_616 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| Int)) (or (= |c_ULTIMATE.start_fifo_drop_head_~old~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| v_ArrVal_616)) |c_pusherThread1of1ForFork0_#in~q_#1.base|) (+ |c_pusherThread1of1ForFork0_#in~q_#1.offset| 4))) (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_32| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|))))) is different from false [2022-09-29 22:34:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:34:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:34:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-09-29 22:34:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-09-29 22:34:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-09-29 22:34:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:34:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:34:56,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-09-29 22:34:56,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:34:56,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:34:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:34:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1742452825, now seen corresponding path program 1 times [2022-09-29 22:34:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:34:56,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252559193] [2022-09-29 22:34:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:34:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:34:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:35:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-09-29 22:35:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:35:00,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252559193] [2022-09-29 22:35:00,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252559193] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:35:00,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417603724] [2022-09-29 22:35:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:35:00,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:35:00,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:35:00,556 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-09-29 22:35:00,556 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-09-29 22:35:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:35:01,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 2333 conjuncts, 258 conjunts are in the unsatisfiable core [2022-09-29 22:35:01,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:35:01,350 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-09-29 22:35:02,054 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 11 treesize of output 7 [2022-09-29 22:35:02,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:02,403 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-09-29 22:35:02,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:02,895 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-09-29 22:35:03,360 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 11 treesize of output 7 [2022-09-29 22:35:03,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:03,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:03,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-09-29 22:35:06,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:06,475 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-09-29 22:35:06,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-09-29 22:35:07,026 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 35 treesize of output 33 [2022-09-29 22:35:07,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:07,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-09-29 22:35:12,858 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-29 22:35:12,859 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 71 treesize of output 66 [2022-09-29 22:35:12,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:12,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:35:12,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:35:12,874 INFO L356 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-09-29 22:35:12,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 46 [2022-09-29 22:35:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-09-29 22:35:14,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:35:14,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417603724] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:35:14,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:35:14,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [82] total 151 [2022-09-29 22:35:14,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758774450] [2022-09-29 22:35:14,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:35:14,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-09-29 22:35:14,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:35:14,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-09-29 22:35:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=21938, Unknown=0, NotChecked=0, Total=22650 [2022-09-29 22:35:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:35:14,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:35:14,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 12.464788732394366) internal successors, (885), 71 states have internal predecessors, (885), 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-09-29 22:35:14,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:35:14,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:35:14,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-09-29 22:35:14,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-09-29 22:35:14,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 214 states. [2022-09-29 22:35:14,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:35:14,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:35:14,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:35:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:35:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:35:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:35:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:35:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-09-29 22:35:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:35:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:35:37,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-09-29 22:35:37,912 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-09-29 22:35:38,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:35:38,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:35:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:35:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1715991633, now seen corresponding path program 1 times [2022-09-29 22:35:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:35:38,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41520176] [2022-09-29 22:35:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:35:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:35:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:35:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:35:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:35:39,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41520176] [2022-09-29 22:35:39,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41520176] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:35:39,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606273998] [2022-09-29 22:35:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:35:39,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:35:39,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:35:39,763 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-09-29 22:35:39,763 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-09-29 22:35:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:35:40,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 270 conjunts are in the unsatisfiable core [2022-09-29 22:35:40,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:35:40,347 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-09-29 22:35:41,141 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 11 treesize of output 7 [2022-09-29 22:35:41,145 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 11 treesize of output 7 [2022-09-29 22:35:43,590 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-09-29 22:35:43,591 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 20 treesize of output 22 [2022-09-29 22:35:44,101 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-09-29 22:35:44,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 69 [2022-09-29 22:35:44,109 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-29 22:35:44,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 63 [2022-09-29 22:35:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-09-29 22:35:48,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:35:48,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606273998] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:35:48,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:35:48,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [54] total 115 [2022-09-29 22:35:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567208688] [2022-09-29 22:35:48,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:35:48,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-09-29 22:35:48,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:35:48,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-09-29 22:35:48,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=12658, Unknown=0, NotChecked=0, Total=13110 [2022-09-29 22:35:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:35:48,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:35:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 10.741935483870968) internal successors, (666), 62 states have internal predecessors, (666), 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-09-29 22:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:35:48,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:35:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:35:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 214 states. [2022-09-29 22:35:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:35:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:35:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-09-29 22:35:48,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:36:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-09-29 22:36:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-09-29 22:36:14,736 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-09-29 22:36:14,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-09-29 22:36:14,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:36:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:36:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 499621786, now seen corresponding path program 1 times [2022-09-29 22:36:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:36:14,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167305558] [2022-09-29 22:36:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:36:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:36:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:36:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 95 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:36:19,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:36:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167305558] [2022-09-29 22:36:19,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167305558] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:36:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768643989] [2022-09-29 22:36:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:36:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:36:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:36:19,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:36:19,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-29 22:36:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:36:20,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 2882 conjuncts, 211 conjunts are in the unsatisfiable core [2022-09-29 22:36:20,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:36:25,125 INFO L356 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-09-29 22:36:25,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 57 [2022-09-29 22:36:25,170 INFO L356 Elim1Store]: treesize reduction 44, result has 61.7 percent of original size [2022-09-29 22:36:25,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 90 [2022-09-29 22:36:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-09-29 22:36:28,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:36:28,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768643989] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:36:28,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:36:28,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [83] total 134 [2022-09-29 22:36:28,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118430622] [2022-09-29 22:36:28,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:36:28,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-29 22:36:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:36:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-29 22:36:28,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=17166, Unknown=0, NotChecked=0, Total=17822 [2022-09-29 22:36:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:28,557 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:36:28,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 18.703703703703702) internal successors, (1010), 54 states have internal predecessors, (1010), 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-09-29 22:36:28,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:28,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:36:28,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:36:28,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-09-29 22:36:28,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 225 states. [2022-09-29 22:36:28,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:36:28,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:36:28,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-09-29 22:36:28,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2022-09-29 22:36:28,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:36:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-09-29 22:36:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-09-29 22:36:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2022-09-29 22:36:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:36:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:36:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-09-29 22:36:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-09-29 22:36:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-09-29 22:36:45,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-09-29 22:36:45,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-09-29 22:36:45,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:36:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:36:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1627575166, now seen corresponding path program 1 times [2022-09-29 22:36:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:36:45,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437781188] [2022-09-29 22:36:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:36:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:36:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:36:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-09-29 22:36:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:36:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437781188] [2022-09-29 22:36:45,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437781188] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:36:45,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:36:45,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-09-29 22:36:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51768035] [2022-09-29 22:36:45,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:36:45,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-09-29 22:36:45,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:36:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-09-29 22:36:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-09-29 22:36:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:45,881 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:36:45,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.76190476190476) internal successors, (814), 21 states have internal predecessors, (814), 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-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 225 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-09-29 22:36:45,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2022-09-29 22:36:45,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-09-29 22:36:45,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:37:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-09-29 22:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-29 22:37:00,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-29 22:37:00,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:37:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:37:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash 908309262, now seen corresponding path program 1 times [2022-09-29 22:37:00,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:37:00,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950416448] [2022-09-29 22:37:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:37:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:37:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:37:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 934 proven. 607 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-09-29 22:37:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:37:27,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950416448] [2022-09-29 22:37:27,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950416448] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:37:27,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488745036] [2022-09-29 22:37:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:37:27,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:37:27,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:37:27,624 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:37:27,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-09-29 22:37:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:37:28,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 4334 conjuncts, 346 conjunts are in the unsatisfiable core [2022-09-29 22:37:28,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:37:30,090 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 11 treesize of output 7 [2022-09-29 22:37:32,458 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-29 22:37:32,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-29 22:37:33,442 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 20 treesize of output 20 [2022-09-29 22:37:42,579 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-09-29 22:37:42,580 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 20 treesize of output 22 [2022-09-29 22:38:32,142 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 22:38:32,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:38:32,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-09-29 22:39:06,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:06,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-29 22:39:06,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:06,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:06,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2022-09-29 22:39:07,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:07,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-29 22:39:07,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:07,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:07,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:07,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:07,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2022-09-29 22:39:10,694 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-09-29 22:39:10,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 64 [2022-09-29 22:39:10,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:10,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2022-09-29 22:39:10,713 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-29 22:39:10,713 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 1 case distinctions, treesize of input 32 treesize of output 25 [2022-09-29 22:39:11,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 [2022-09-29 22:39:12,364 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 26 [2022-09-29 22:39:12,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 22:39:13,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:39:13,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:39:13,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-09-29 22:39:14,161 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 18 treesize of output 20 [2022-09-29 22:39:14,912 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 22:39:14,914 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 31 treesize of output 30 [2022-09-29 22:39:15,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:39:15,985 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 41 treesize of output 27 [2022-09-29 22:39:17,799 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2022-09-29 22:39:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 106 proven. 1425 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-09-29 22:39:18,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:39:21,016 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 122 treesize of output 116 [2022-09-29 22:40:09,292 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1981))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_162) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_1981))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 v_arrayElimCell_162) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))))) is different from false [2022-09-29 22:40:09,351 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1981))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_162) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1981))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_162) .cse2) .cse2))))))) is different from false [2022-09-29 22:40:09,382 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1981))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_162) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_1981))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_162) .cse2) .cse2))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0))) is different from false [2022-09-29 22:40:09,415 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_1981))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ 12 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (< (select (select .cse4 v_arrayElimCell_162) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_1981))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse2 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (or (< (select (select .cse1 v_arrayElimCell_162) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))))) is different from false [2022-09-29 22:40:09,439 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_1981))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_162) .cse5) .cse5)))))) (and (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_1981))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse1 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1) (< (select (select .cse0 v_arrayElimCell_162) .cse1) .cse1))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) (or .cse3 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) is different from false [2022-09-29 22:40:09,517 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse5 (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_1981))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse6 (+ (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse5 v_arrayElimCell_162) .cse6) .cse6)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_arrayElimCell_162 Int) (v_ArrVal_1981 (Array Int Int))) (let ((.cse1 (let ((.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) v_ArrVal_1981))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse2 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_162) .cse2) .cse2))))) (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)))) is different from false [2022-09-29 22:40:09,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:40:09,790 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 702 treesize of output 519 [2022-09-29 22:40:09,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:40:09,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 14717 treesize of output 14115 [2022-09-29 22:40:10,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:40:10,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 16596 treesize of output 14593 [2022-09-29 22:40:10,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:40:10,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 14516 treesize of output 14025 [2022-09-29 22:40:11,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:40:11,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 15032 treesize of output 14037 [2022-09-29 22:40:12,520 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 Received shutdown request... [2022-09-29 22:40:16,055 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-09-29 22:40:16,055 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-09-29 22:40:16,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 22:40:16,068 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-29 22:40:16,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 22:40:16,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-09-29 22:40:16,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-09-29 22:40:16,288 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1776 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 10ms.. [2022-09-29 22:40:16,291 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 22:40:16,293 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-09-29 22:40:16,294 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-29 22:40:16,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-29 22:40:16,296 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1234.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.09 10:40:16 BasicIcfg [2022-09-29 22:40:16,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-29 22:40:16,297 INFO L158 Benchmark]: Toolchain (without parser) took 771559.41ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 125.1MB in the beginning and 360.0MB in the end (delta: -234.9MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-09-29 22:40:16,297 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 22:40:16,297 INFO L158 Benchmark]: Boogie Preprocessor took 138.89ms. Allocated memory is still 176.2MB. Free memory was 125.0MB in the beginning and 145.4MB in the end (delta: -20.4MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-09-29 22:40:16,297 INFO L158 Benchmark]: RCFGBuilder took 1322.07ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 145.4MB in the beginning and 182.3MB in the end (delta: -36.9MB). Peak memory consumption was 55.9MB. Max. memory is 8.0GB. [2022-09-29 22:40:16,298 INFO L158 Benchmark]: TraceAbstraction took 770080.83ms. Allocated memory was 241.2MB in the beginning and 1.2GB in the end (delta: 946.9MB). Free memory was 181.7MB in the beginning and 360.0MB in the end (delta: -178.3MB). Peak memory consumption was 998.7MB. Max. memory is 8.0GB. [2022-09-29 22:40:16,298 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.17ms. Allocated memory is still 176.2MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 138.89ms. Allocated memory is still 176.2MB. Free memory was 125.0MB in the beginning and 145.4MB in the end (delta: -20.4MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1322.07ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 145.4MB in the beginning and 182.3MB in the end (delta: -36.9MB). Peak memory consumption was 55.9MB. Max. memory is 8.0GB. * TraceAbstraction took 770080.83ms. Allocated memory was 241.2MB in the beginning and 1.2GB in the end (delta: 946.9MB). Free memory was 181.7MB in the beginning and 360.0MB in the end (delta: -178.3MB). Peak memory consumption was 998.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 239, positive: 230, positive conditional: 230, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 9, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 869, positive: 842, positive conditional: 842, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 844, Positive conditional cache size: 0, Positive unconditional cache size: 844, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 36, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2569, positive: 2489, positive conditional: 2489, positive unconditional: 0, negative: 80, negative conditional: 80, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 1838, Positive cache size: 1838, Positive conditional cache size: 0, Positive unconditional cache size: 1838, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 116, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2756, positive: 2667, positive conditional: 2667, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 2424, Positive cache size: 2423, Positive conditional cache size: 0, Positive unconditional cache size: 2423, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 204, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3025, positive: 2915, positive conditional: 2915, positive unconditional: 0, negative: 110, negative conditional: 110, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 3400, Positive cache size: 3398, Positive conditional cache size: 0, Positive unconditional cache size: 3398, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 312, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3252, positive: 3140, positive conditional: 3140, positive unconditional: 0, negative: 112, negative conditional: 112, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 4674, Positive cache size: 4670, Positive conditional cache size: 0, Positive unconditional cache size: 4670, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 422, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4698, positive: 4540, positive conditional: 4540, positive unconditional: 0, negative: 158, negative conditional: 158, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 5744, Positive cache size: 5737, Positive conditional cache size: 0, Positive unconditional cache size: 5737, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Independence queries for same thread: 576, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2820, positive: 2705, positive conditional: 2705, positive unconditional: 0, negative: 115, negative conditional: 115, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 6082, Positive cache size: 6074, Positive conditional cache size: 0, Positive unconditional cache size: 6074, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 689, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2081, positive: 2009, positive conditional: 2009, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 6182, Positive cache size: 6174, Positive conditional cache size: 0, Positive unconditional cache size: 6174, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 761, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5519, positive: 5336, positive conditional: 5336, positive unconditional: 0, negative: 183, negative conditional: 183, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 7268, Positive cache size: 7257, Positive conditional cache size: 0, Positive unconditional cache size: 7257, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Independence queries for same thread: 938, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4848, positive: 4686, positive conditional: 4686, positive unconditional: 0, negative: 162, negative conditional: 162, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 7361, Positive cache size: 7349, Positive conditional cache size: 0, Positive unconditional cache size: 7349, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Independence queries for same thread: 1095, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11081, positive: 10717, positive conditional: 10717, positive unconditional: 0, negative: 364, negative conditional: 364, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43757, positive: 42276, positive conditional: 42276, positive unconditional: 0, negative: 1481, negative conditional: 1481, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42307, positive: 42276, positive conditional: 0, positive unconditional: 42276, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9788, positive: 9772, positive conditional: 0, positive unconditional: 9772, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42307, positive: 32504, positive conditional: 0, positive unconditional: 32504, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 9788, unknown conditional: 0, unknown unconditional: 9788] , Statistics on independence cache: Total cache size (in pairs): 9788, Positive cache size: 9772, Positive conditional cache size: 0, Positive unconditional cache size: 9772, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Independence queries for same thread: 1450, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1776 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 769.8s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 351.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 952, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 214.9s InterpolantComputationTime, 16778 NumberOfCodeBlocks, 15974 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 17765 ConstructedInterpolants, 1440 QuantifiedInterpolants, 312771 SizeOfPredicates, 861 NumberOfNonLiveVariables, 16572 ConjunctsInSsa, 1713 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 963/1220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown