/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-bug_1w1r.line1270.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:31:08,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:31:08,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:31:08,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:31:08,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:31:08,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:31:08,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:31:08,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:31:08,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:31:08,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:31:08,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:31:08,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:31:08,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:31:08,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:31:08,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:31:08,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:31:08,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:31:08,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:31:08,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:31:08,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:31:08,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:31:08,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:31:08,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:31:08,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:31:08,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:31:08,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:31:08,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:31:08,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:31:08,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:31:08,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:31:08,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:31:08,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:31:08,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:31:08,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:31:08,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:31:08,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:31:08,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:31:08,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:31:08,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:31:08,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:31:08,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:31:08,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 14:31:08,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:31:08,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:31:08,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:31:08,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:31:09,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:31:09,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:31:09,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:31:09,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:31:09,001 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:31:09,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:31:09,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:31:09,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:31:09,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:31:09,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:31:09,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:31:09,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:31:09,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:31:09,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:31:09,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:31:09,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:31:09,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:31:09,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:31:09,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:31:09,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:31:09,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:31:09,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:31:09,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:31:09,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:31:09,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:31:09,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:31:09,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:31:09,005 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:31:09,005 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:31:09,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:31:09,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:31:09,006 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:31:09,006 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:31:09,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:31:09,006 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 14:31:09,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:31:09,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:31:09,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:31:09,241 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:31:09,243 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:31:09,245 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-bug_1w1r.line1270.bpl [2022-10-03 14:31:09,245 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1270.bpl' [2022-10-03 14:31:09,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:31:09,326 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:31:09,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:31:09,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:31:09,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:31:09,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:31:09,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:31:09,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:31:09,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:31:09,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/1) ... [2022-10-03 14:31:09,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:31:09,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:31:09,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 14:31:09,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 14:31:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:31:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:31:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:31:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:31:09,548 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 14:31:09,772 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:31:09,774 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:31:10,912 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:31:10,947 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:31:10,948 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:31:10,951 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:10 BoogieIcfgContainer [2022-10-03 14:31:10,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:31:10,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:31:10,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:31:10,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:31:10,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:31:09" (1/2) ... [2022-10-03 14:31:10,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc7bf66 and model type divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:10, skipping insertion in model container [2022-10-03 14:31:10,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1270.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:10" (2/2) ... [2022-10-03 14:31:10,960 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1270.bpl [2022-10-03 14:31:10,967 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:31:10,975 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:31:10,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:31:10,975 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:31:11,145 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:31:11,219 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:31:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:31:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:31:11,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-03 14:31:11,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-03 14:31:11,254 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:31:11,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:31:11,281 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;@10c2bae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:31:11,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:31:11,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:31:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:31:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1241616502, now seen corresponding path program 1 times [2022-10-03 14:31:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:31:11,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346059101] [2022-10-03 14:31:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:31:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:31:12,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346059101] [2022-10-03 14:31:12,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346059101] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:31:12,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:31:12,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:31:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511015636] [2022-10-03 14:31:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:31:12,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:31:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:31:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:31:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:31:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:12,218 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:31:12,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 239.5) internal successors, (479), 2 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:31:12,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:12,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:31:12,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:31:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:31:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash 368485223, now seen corresponding path program 1 times [2022-10-03 14:31:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:31:12,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927576141] [2022-10-03 14:31:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:12,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:31:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:31:16,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927576141] [2022-10-03 14:31:16,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927576141] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:31:16,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:31:16,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 14:31:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158264559] [2022-10-03 14:31:16,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:31:16,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 14:31:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:31:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 14:31:16,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3597, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 14:31:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:16,617 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:31:16,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 8.806451612903226) internal successors, (546), 62 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:31:16,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:16,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-10-03 14:31:33,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:31:33,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:31:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:31:33,785 INFO L85 PathProgramCache]: Analyzing trace with hash -366579047, now seen corresponding path program 1 times [2022-10-03 14:31:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:31:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74117336] [2022-10-03 14:31:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:31:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:36,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:31:36,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74117336] [2022-10-03 14:31:36,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74117336] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:31:36,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:31:36,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-10-03 14:31:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038120998] [2022-10-03 14:31:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:31:36,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-10-03 14:31:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:31:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-10-03 14:31:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2868, Unknown=0, NotChecked=0, Total=3080 [2022-10-03 14:31:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:36,021 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:31:36,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 8.89090909090909) internal successors, (489), 56 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:31:36,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:36,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-10-03 14:31:36,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:31:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:31:49,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:31:49,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:31:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:31:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash 733226, now seen corresponding path program 1 times [2022-10-03 14:31:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:31:49,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690696132] [2022-10-03 14:31:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:31:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:31:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:31:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:31:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:31:52,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690696132] [2022-10-03 14:31:52,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690696132] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:31:52,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:31:52,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 14:31:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229371024] [2022-10-03 14:31:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:31:52,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 14:31:52,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:31:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 14:31:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5033, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 14:31:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:52,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:31:52,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 10.917808219178083) internal successors, (797), 73 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:31:52,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:31:52,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:31:52,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:31:52,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:32:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:32:15,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 14:32:15,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:32:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:32:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -461554097, now seen corresponding path program 1 times [2022-10-03 14:32:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:32:15,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299837901] [2022-10-03 14:32:15,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:32:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:32:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:32:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:32:19,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:32:19,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299837901] [2022-10-03 14:32:19,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299837901] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:32:19,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:32:19,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-10-03 14:32:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018540506] [2022-10-03 14:32:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:32:19,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-10-03 14:32:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:32:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-10-03 14:32:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=6536, Unknown=0, NotChecked=0, Total=6806 [2022-10-03 14:32:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:19,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:32:19,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 8.686746987951807) internal successors, (721), 83 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:32:19,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:19,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:32:19,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:32:19,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:32:19,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:32:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:32:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-10-03 14:32:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-10-03 14:32:49,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 14:32:49,097 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:32:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:32:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1826214005, now seen corresponding path program 1 times [2022-10-03 14:32:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:32:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762928531] [2022-10-03 14:32:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:32:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:32:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:32:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 70 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:32:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:32:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762928531] [2022-10-03 14:32:53,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762928531] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:32:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432571255] [2022-10-03 14:32:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:32:53,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:32:53,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:32:53,340 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-10-03 14:32:53,341 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-10-03 14:32:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:32:53,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 2285 conjuncts, 73 conjunts are in the unsatisfiable core [2022-10-03 14:32:53,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:32:56,654 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 23 treesize of output 15 [2022-10-03 14:32:56,659 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-10-03 14:32:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 213 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 14:32:56,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:32:57,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:32:57,630 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 32 treesize of output 36 [2022-10-03 14:32:57,975 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-03 14:32:57,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2022-10-03 14:32:57,986 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-10-03 14:32:57,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-10-03 14:32:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 14:32:58,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432571255] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-03 14:32:58,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-03 14:32:58,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [91, 20] total 123 [2022-10-03 14:32:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938543755] [2022-10-03 14:32:58,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:32:58,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 14:32:58,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:32:58,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 14:32:58,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=14608, Unknown=0, NotChecked=0, Total=15006 [2022-10-03 14:32:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:58,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:32:58,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 59.0625) internal successors, (945), 17 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:32:58,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:32:58,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:32:58,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:32:58,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-10-03 14:32:58,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-10-03 14:32:58,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:33:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:33:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:33:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:33:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-10-03 14:33:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-03 14:33:04,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 14:33:04,411 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,SelfDestructingSolverStorable5 [2022-10-03 14:33:04,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:33:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:33:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1686210532, now seen corresponding path program 1 times [2022-10-03 14:33:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:33:04,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104692168] [2022-10-03 14:33:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:04,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:33:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 236 proven. 182 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-03 14:33:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:33:08,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104692168] [2022-10-03 14:33:08,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104692168] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:33:08,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255515107] [2022-10-03 14:33:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:33:08,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:33:08,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:33:08,848 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-10-03 14:33:08,851 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-10-03 14:33:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:33:09,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 3047 conjuncts, 335 conjunts are in the unsatisfiable core [2022-10-03 14:33:09,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:33:10,874 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-10-03 14:33:10,885 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-10-03 14:33:12,851 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:33:12,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 14:33:13,423 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 29 treesize of output 27 [2022-10-03 14:33:13,438 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 27 treesize of output 25 [2022-10-03 14:33:19,931 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:33:19,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 47 [2022-10-03 14:33:19,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:19,942 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 29 [2022-10-03 14:33:25,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:25,940 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 43 treesize of output 30 [2022-10-03 14:33:25,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:25,953 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 32 treesize of output 23 [2022-10-03 14:33:29,215 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:33:29,215 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2022-10-03 14:33:29,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:29,227 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 18 treesize of output 20 [2022-10-03 14:33:30,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:30,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:33:30,695 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-10-03 14:33:30,703 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 19 treesize of output 18 [2022-10-03 14:33:32,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:32,409 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 30 treesize of output 25 [2022-10-03 14:33:32,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:33:32,417 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 19 treesize of output 18 [2022-10-03 14:33:34,252 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 26 treesize of output 10 [2022-10-03 14:33:34,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:33:34,257 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 1 case distinctions, treesize of input 37 treesize of output 17 [2022-10-03 14:33:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 182 proven. 268 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:33:34,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:35:30,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:35:30,854 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 652 treesize of output 656 [2022-10-03 14:37:32,678 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 14:37:32,679 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 3 case distinctions, treesize of input 2156 treesize of output 1472 [2022-10-03 14:37:32,734 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 14:37:32,735 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 3 case distinctions, treesize of input 1440 treesize of output 1340 [2022-10-03 14:37:32,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:32,891 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 9892 treesize of output 9418 [2022-10-03 14:37:33,217 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:33,219 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 25240 treesize of output 25002 [2022-10-03 14:37:33,363 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 26919 treesize of output 26407 [2022-10-03 14:37:33,887 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 26327 treesize of output 26199 [2022-10-03 14:37:34,277 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 28359 treesize of output 27847 [2022-10-03 14:37:34,723 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 27575 treesize of output 27127 [2022-10-03 14:37:35,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:35,167 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 27207 treesize of output 26839 [2022-10-03 14:37:35,468 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 27795 treesize of output 27539 [2022-10-03 14:37:35,953 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 27907 treesize of output 27779 [2022-10-03 14:37:36,326 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 27851 treesize of output 27211 [2022-10-03 14:37:36,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:36,689 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 27231 treesize of output 26747 [2022-10-03 14:37:37,036 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 27991 treesize of output 27735 [2022-10-03 14:37:37,530 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 27959 treesize of output 27831 [2022-10-03 14:37:38,040 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 28183 treesize of output 28055 [2022-10-03 14:37:38,438 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 30407 treesize of output 29895 [2022-10-03 14:37:38,942 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 29125 treesize of output 28581 [2022-10-03 14:37:39,327 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 29203 treesize of output 29075 [2022-10-03 14:37:39,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:39,850 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 28929 treesize of output 28521 [2022-10-03 14:37:40,246 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 29783 treesize of output 29527 [2022-10-03 14:37:40,807 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 29297 treesize of output 29249 [2022-10-03 14:37:46,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-03 14:37:46,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-03 14:37:46,409 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 10 treesize of output 4 [2022-10-03 14:37:46,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:46,434 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 49 treesize of output 57 [2022-10-03 14:37:46,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:46,472 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 64 treesize of output 68 [2022-10-03 14:37:46,531 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 10 treesize of output 4 [2022-10-03 14:37:46,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:46,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 765 treesize of output 745 [2022-10-03 14:37:48,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:37:48,221 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 3563 treesize of output 3119 [2022-10-03 14:38:11,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:38:11,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 102 treesize of output 256 [2022-10-03 14:38:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:38:15,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255515107] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:38:15,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:38:15,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 99, 98] total 289 [2022-10-03 14:38:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923757301] [2022-10-03 14:38:15,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:38:15,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 289 states [2022-10-03 14:38:15,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:38:15,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 289 interpolants. [2022-10-03 14:38:15,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1373, Invalid=79671, Unknown=2188, NotChecked=0, Total=83232 [2022-10-03 14:38:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:38:15,934 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:38:15,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 289 states, 289 states have (on average 12.491349480968859) internal successors, (3610), 289 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:38:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:38:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-10-03 14:38:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-10-03 14:38:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-10-03 14:38:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2022-10-03 14:38:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-03 14:38:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:38:42,730 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse31 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse28 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse49 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse4 (select .cse28 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse35 (select .cse28 .cse31)) (.cse37 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse29 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|)) (.cse2 (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse36 (select .cse8 .cse31)) (.cse39 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_init_~self#1.base|)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|)) (.cse34 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_init_~self#1.base|))) (let ((.cse1 (select .cse34 |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse32 (select .cse9 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse0 (select .cse39 |c_ULTIMATE.start_fifo_init_~self#1.offset|)) (.cse6 (= .cse2 .cse36)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse33 (select .cse29 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse30 (+ |c_ULTIMATE.start_fifo_node_init_~self#1.offset| 4)) (.cse3 (select .cse37 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse38 (= .cse4 .cse35)) (.cse5 (select .cse49 |c_ULTIMATE.start_fifo_empty_~self#1.offset|))) (and (<= 0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (<= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) 4) (= .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse3) (< |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|) (= .cse4 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (<= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5) 4) (= (select |c_#valid| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|) 1) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (not (= .cse2 |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|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) .cse6 (= (select |c_#valid| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) 1) (<= (+ 2 .cse0) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (<= (select .cse7 .cse5) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse4) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_init_~self#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) (= .cse8 .cse9) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|)) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_525 (Array Int Int)) (v_ArrVal_528 Int) (v_ArrVal_539 Int) (v_ArrVal_538 Int) (|v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_535 Int) (v_ArrVal_534 Int)) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_525))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse11 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse14 (select .cse13 .cse11))) (let ((.cse16 (store (store (select (store (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse18 v_ArrVal_524))) (store .cse17 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_528))) .cse14 v_ArrVal_530) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_534) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_539))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse10 (store (store (select (store (store .cse12 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse14)) .cse14 v_ArrVal_531) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_535) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_538))) (= (select .cse10 .cse11) (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= 0 .cse15) (not (= (select .cse16 .cse11) .cse15)) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8|)) (not (<= |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse22 v_prenex_2))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse20 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse23 (select .cse27 .cse20))) (let ((.cse25 (store (store (select (store (store .cse26 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse27 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse23)) .cse23 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse19 (store (store (select (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| .cse22 v_prenex_1))) (store .cse21 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse23 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (= (select .cse19 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse19 .cse20)))) (not (<= 0 v_prenex_6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse24) (not (= (select .cse25 .cse20) .cse24)) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (= .cse28 .cse29) (<= (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|) .cse30) (= (select |c_#valid| |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) 1) (<= (+ 2 |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= (select |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#valid#1| |c_ULTIMATE.start_fifo_init_~self#1.base|) 1) (= .cse31 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (= .cse1 0) (= (select |c_#valid| .cse32) 1) (<= (select (select |c_#memory_$Pointer$.offset| .cse32) .cse33) 4) (= .cse28 .cse34) (= .cse35 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.offset|) (= .cse4 0) (= .cse36 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= .cse36 |c_ULTIMATE.start_fifo_empty_#t~mem5#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= .cse2 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base|) (= .cse37 .cse8) (= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) 1) (or (and .cse6 |c_ULTIMATE.start_fifo_empty_#t~short10#1| .cse38) (and (or (not .cse38) (not .cse6)) (not |c_ULTIMATE.start_fifo_empty_#t~short10#1|))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_node_init_~self#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) 1) (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= |c_ULTIMATE.start_fifo_init_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (not (= |c_ULTIMATE.start_write~$Pointer$_#value#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse39 .cse8) (<= (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) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse44 (store |c_#memory_$Pointer$.base| .cse48 v_prenex_2))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse42 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse46 (select .cse45 .cse42))) (let ((.cse41 (store (store (select (store (let ((.cse47 (store |c_#memory_$Pointer$.offset| .cse48 v_prenex_1))) (store .cse47 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse47 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse46 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse40 (select .cse41 .cse42))) (not (<= 0 v_prenex_6)) (< .cse40 1) (not (let ((.cse43 (store (store (select (store (store .cse44 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse45 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse46)) .cse46 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (= (select .cse43 .cse42) (select .cse43 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_fifo_init_~self#1.base|) 1) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse35) (= |c_ULTIMATE.start_fifo_node_init_#in~self#1.offset| 0) (= .cse49 .cse28) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select .cse7 .cse33) 4) (= .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_fifo_node_init_~self#1.offset|) .cse30) (= |c_ULTIMATE.start_fifo_node_init_~self#1.offset| 0) (= |c_ULTIMATE.start_fifo_node_init_#res#1.offset| 0) (<= (+ .cse2 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.offset| 0) (not (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) 1) (= .cse5 |c_ULTIMATE.start_fifo_empty_#t~mem4#1.offset|) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= (select |c_#valid| .cse3) 1) .cse38 (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|))))) is different from false [2022-10-03 14:38:44,120 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse0 (select .cse2 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse25 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= (select (select |c_#memory_$Pointer$.offset| .cse0) (select .cse1 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) 4) (= .cse2 .cse3) (not (= .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse4 (select .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse6 .cse1) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_525 (Array Int Int)) (v_ArrVal_528 Int) (v_ArrVal_539 Int) (v_ArrVal_538 Int) (|v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_535 Int) (v_ArrVal_534 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse15 v_ArrVal_525))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse8 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse11 (select .cse10 .cse8))) (let ((.cse13 (store (store (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_524))) (store .cse14 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_528))) .cse11 v_ArrVal_530) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_534) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_539))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse7 (store (store (select (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_531) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_535) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_538))) (= (select .cse7 .cse8) (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= 0 .cse12) (not (= (select .cse13 .cse8) .cse12)) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8|)) (not (<= |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse23 (store |c_#memory_$Pointer$.base| .cse19 v_prenex_2))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse17 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse20 (select .cse24 .cse17))) (let ((.cse22 (store (store (select (store (store .cse23 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse24 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse20)) .cse20 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse16 (store (store (select (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| .cse19 v_prenex_1))) (store .cse18 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse20 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (= (select .cse16 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse16 .cse17)))) (not (<= 0 v_prenex_6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse21) (not (= (select .cse22 .cse17) .cse21)) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (= .cse25 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse34 v_prenex_2))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse28 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse32 (select .cse31 .cse28))) (let ((.cse27 (store (store (select (store (let ((.cse33 (store |c_#memory_$Pointer$.offset| .cse34 v_prenex_1))) (store .cse33 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse32 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse26 (select .cse27 .cse28))) (not (<= 0 v_prenex_6)) (< .cse26 1) (not (let ((.cse29 (store (store (select (store (store .cse30 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse31 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse32)) .cse32 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (= (select .cse29 .cse28) (select .cse29 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse25 (select .cse6 .cse5))))) is different from false [2022-10-03 14:39:22,640 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse63 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse60 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse33 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse58 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|)) (.cse3 (select .cse15 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse65 (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse96 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse62 (select .cse14 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse32 (select .cse34 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse64 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|)) (.cse39 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_#in~self#1.base|))) (let ((.cse1 (select .cse39 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse38 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)) (.cse18 (select .cse64 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse61 (select .cse39 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse62) .cse32)) (.cse19 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)) .cse96)) (.cse20 (+ .cse96 8)) (.cse76 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse65 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse36 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse59 (select .cse58 |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|)) (.cse16 (select .cse64 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse37 (select .cse33 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse21 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse17 (select .cse60 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse35 (select .cse63 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse66 (select .cse14 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (<= 0 |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| .cse0)) (not (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| .cse1)) (<= .cse2 4) (= .cse3 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (forall ((v_ArrVal_528 Int) (v_ArrVal_539 Int) (v_ArrVal_538 Int) (|v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_535 Int) (v_ArrVal_534 Int) (v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_522))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse6 (store .cse13 .cse12 v_ArrVal_525))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse8 (select .cse7 .cse5))) (let ((.cse9 (store (store (select (store (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_523) .cse12 v_ArrVal_524))) (store .cse11 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_528))) .cse8 v_ArrVal_530) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_534) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_539))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse4 (store (store (select (store (store .cse6 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse8)) .cse8 v_ArrVal_531) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_535) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_538))) (= (select .cse4 .cse5) (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (= (select .cse9 .cse5) .cse10)) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8|)) (not (<= |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| |c_ULTIMATE.start_main_~#q~1#1.offset|)) (<= 0 .cse10)))))))))) (= .cse14 .cse15) (<= (select (select |c_#memory_$Pointer$.offset| .cse16) .cse17) 4) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (not (= .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|)) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (not (= |c_ULTIMATE.start_fifo_empty_~self#1.base| .cse18)) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse19) .cse20) (= .cse3 (select .cse15 .cse21)) (not (= .cse3 |c_ULTIMATE.start_main_~#p~0#1.base|)) (<= .cse19 .cse20) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_ArrVal_522 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int) (v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_523 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_522))) (let ((.cse27 (select (select .cse31 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse29 (store .cse31 .cse27 v_prenex_2))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse24 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse28 (select .cse30 .cse24))) (let ((.cse23 (store (store (select (store (store .cse29 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse30 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse28)) .cse28 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= 0 v_prenex_6)) (not (= .cse22 (select .cse23 .cse24))) (not (let ((.cse25 (store (store (select (store (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_523) .cse27 v_prenex_1))) (store .cse26 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse28 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (= (select .cse25 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse25 .cse24)))) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= .cse22 .cse27)))))))))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (<= .cse32 .cse20) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#q~1#1.base|)) (= .cse33 .cse34) (= |c_ULTIMATE.start_fifo_front_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.offset| .cse0) .cse35) 4) (<= (select .cse36 .cse17) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse20) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#sizeOfReadType#1| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (select |c_#length| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|)) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse37) (<= .cse38 4) (<= (+ .cse17 .cse19) .cse20) (= .cse15 .cse39) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_525 (Array Int Int)) (v_ArrVal_528 Int) (v_ArrVal_539 Int) (v_ArrVal_538 Int) (|v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_535 Int) (v_ArrVal_534 Int)) (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse42 (store |c_#memory_$Pointer$.base| .cse48 v_ArrVal_525))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse41 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse44 (select .cse43 .cse41))) (let ((.cse46 (store (store (select (store (let ((.cse47 (store |c_#memory_$Pointer$.offset| .cse48 v_ArrVal_524))) (store .cse47 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse47 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_528))) .cse44 v_ArrVal_530) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_534) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_539))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse40 (store (store (select (store (store .cse42 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse43 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse44)) .cse44 v_ArrVal_531) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_ArrVal_535) |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| v_ArrVal_538))) (= (select .cse40 .cse41) (select .cse40 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (<= 0 .cse45) (not (= (select .cse46 .cse41) .cse45)) (not (<= 0 |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8|)) (not (<= |v_ULTIMATE.start_fifo_drop_head_#in~self#1.offset_8| |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse52 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse56 (store |c_#memory_$Pointer$.base| .cse52 v_prenex_2))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse50 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse53 (select .cse57 .cse50))) (let ((.cse55 (store (store (select (store (store .cse56 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse57 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse53)) .cse53 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (let ((.cse54 (select .cse55 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse49 (store (store (select (store (let ((.cse51 (store |c_#memory_$Pointer$.offset| .cse52 v_prenex_1))) (store .cse51 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse51 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse53 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (= (select .cse49 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse49 .cse50)))) (not (<= 0 v_prenex_6)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) .cse54) (not (= (select .cse55 .cse50) .cse54)) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (= .cse33 .cse58) (<= (select (select |c_#memory_$Pointer$.offset| .cse1) (select .cse58 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (<= (+ .cse59 .cse19) .cse20) (<= .cse38 .cse20) (<= (select (select |c_#memory_$Pointer$.offset| .cse18) (select .cse60 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (= (select |c_#valid| .cse61) 1) (<= (select (select |c_#memory_$Pointer$.offset| .cse61) .cse59) 4) (= .cse37 0) (= (select |c_#valid| .cse62) 1) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= .cse35 (select .cse63 .cse21)) (<= (select .cse36 .cse37) 4) (= .cse64 .cse15) (= (select |c_#valid| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (<= (+ .cse32 .cse19) .cse20) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= .cse2 .cse20) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_main_~#p~0#1.base|)) (<= (+ |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse19) .cse20) (= .cse0 (select .cse65 .cse21)) (<= (select (select |c_#memory_$Pointer$.offset| .cse66) (select .cse34 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) (<= (select .cse36 .cse32) 4) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse71 (store |c_#memory_$Pointer$.base| .cse75 v_prenex_2))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse69 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse73 (select .cse72 .cse69))) (let ((.cse68 (store (store (select (store (let ((.cse74 (store |c_#memory_$Pointer$.offset| .cse75 v_prenex_1))) (store .cse74 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse74 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse73 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (let ((.cse67 (select .cse68 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse67 (select .cse68 .cse69))) (not (<= 0 v_prenex_6)) (< .cse67 1) (not (let ((.cse70 (store (store (select (store (store .cse71 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse72 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse73)) .cse73 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (= (select .cse70 .cse69) (select .cse70 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))))) (not (= .cse0 |c_ULTIMATE.start_write~int_#ptr#1.base|)) (not (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| .cse76)) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (not (= .cse0 |c_ULTIMATE.start_main_~#p~0#1.base|)) (<= (select (select |c_#memory_$Pointer$.offset| .cse76) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |c_ULTIMATE.start_fifo_front_#in~self#1.offset|)) 4) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse60 .cse33) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (select .cse36 .cse59) 4) (= .cse16 |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (<= (+ .cse3 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_front_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_ArrVal_522 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int) (v_prenex_8 (Array Int Int)) (v_prenex_6 Int) (v_ArrVal_523 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse86 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_522))) (let ((.cse85 (select (select .cse86 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse80 (store .cse86 .cse85 v_prenex_2))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse79 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse82 (select .cse81 .cse79))) (let ((.cse83 (store (store (select (store (let ((.cse84 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_523) .cse85 v_prenex_1))) (store .cse84 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse84 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse82 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (let ((.cse77 (select .cse83 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< .cse77 1) (not (<= 0 v_prenex_6)) (not (let ((.cse78 (store (store (select (store (store .cse80 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse81 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse82)) .cse82 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (= (select .cse78 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse78 .cse79)))) (not (= .cse77 (select .cse83 .cse79))) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))))) (= (select |c_#valid| .cse16) 1) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_10 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse94 (store |c_#memory_$Pointer$.base| .cse90 v_prenex_2))) (let ((.cse95 (select .cse94 |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse88 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse91 (select .cse95 .cse88))) (let ((.cse92 (store (store (select (store (store .cse94 |c_ULTIMATE.start_main_~#q~1#1.base| (store .cse95 |c_ULTIMATE.start_main_~#q~1#1.offset| .cse91)) .cse91 v_prenex_7) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_9) v_prenex_6 v_prenex_5))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (let ((.cse87 (store (store (select (store (let ((.cse89 (store |c_#memory_$Pointer$.offset| .cse90 v_prenex_1))) (store .cse89 |c_ULTIMATE.start_main_~#q~1#1.base| (store (select .cse89 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_3))) .cse91 v_prenex_8) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset| v_prenex_10) v_prenex_6 v_prenex_4))) (= (select .cse87 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse87 .cse88)))) (not (<= 0 v_prenex_6)) (not (= (select .cse92 .cse88) .cse93)) (not (<= v_prenex_6 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.base| .cse93))))))))) (= .cse37 (select .cse33 .cse21)) (= |c_ULTIMATE.start_fifo_front_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (= |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| .cse17) (= .cse35 0) (not (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| .cse66)))))) is different from false [2022-10-03 14:40:18,677 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-10-03 14:40:18,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-10-03 14:40:18,705 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-10-03 14:40:18,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:40:18,879 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:152) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:234) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:164) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:97) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:121) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:322) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 53 more [2022-10-03 14:40:18,883 INFO L158 Benchmark]: Toolchain (without parser) took 549556.81ms. Allocated memory was 174.1MB in the beginning and 958.4MB in the end (delta: 784.3MB). Free memory was 122.0MB in the beginning and 627.0MB in the end (delta: -505.0MB). Peak memory consumption was 279.8MB. Max. memory is 8.0GB. [2022-10-03 14:40:18,884 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:40:18,884 INFO L158 Benchmark]: Boogie Preprocessor took 120.66ms. Allocated memory is still 174.1MB. Free memory was 122.0MB in the beginning and 115.3MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 14:40:18,884 INFO L158 Benchmark]: RCFGBuilder took 1501.78ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 115.2MB in the beginning and 152.4MB in the end (delta: -37.2MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. [2022-10-03 14:40:18,884 INFO L158 Benchmark]: TraceAbstraction took 547928.60ms. Allocated memory was 251.7MB in the beginning and 958.4MB in the end (delta: 706.7MB). Free memory was 151.9MB in the beginning and 627.0MB in the end (delta: -475.1MB). Peak memory consumption was 231.8MB. Max. memory is 8.0GB. [2022-10-03 14:40:18,886 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.16ms. Allocated memory is still 174.1MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 120.66ms. Allocated memory is still 174.1MB. Free memory was 122.0MB in the beginning and 115.3MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1501.78ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 115.2MB in the beginning and 152.4MB in the end (delta: -37.2MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. * TraceAbstraction took 547928.60ms. Allocated memory was 251.7MB in the beginning and 958.4MB in the end (delta: 706.7MB). Free memory was 151.9MB in the beginning and 627.0MB in the end (delta: -475.1MB). Peak memory consumption was 231.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 14:40:18,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...