/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:10:05,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:10:05,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:10:05,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:10:05,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:10:05,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:10:05,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:10:05,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:10:05,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:10:05,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:10:05,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:10:05,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:10:05,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:10:05,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:10:05,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:10:05,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:10:05,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:10:05,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:10:05,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:10:05,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:10:05,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:10:05,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:10:05,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:10:05,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:10:05,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:10:05,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:10:05,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:10:05,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:10:05,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:10:05,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:10:05,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:10:05,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:10:05,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:10:05,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:10:05,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:10:05,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:10:05,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:10:05,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:10:05,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:10:05,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:10:05,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:10:05,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:10:05,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:10:05,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:10:05,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:10:05,719 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:10:05,719 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:10:05,720 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:10:05,720 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:10:05,720 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:10:05,720 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:10:05,720 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:10:05,721 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:10:05,721 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:10:05,721 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:10:05,721 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:10:05,721 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:10:05,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:10:05,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:10:05,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:10:05,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:10:05,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:10:05,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:10:05,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:10:05,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:10:05,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:10:05,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:10:05,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:10:05,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:10:05,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:10:05,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:10:05,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:10:05,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:10:05,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:10:05,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:10:05,729 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:10:05,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:10:05,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:10:05,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:10:05,730 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:10:06,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:10:06,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:10:06,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:10:06,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:10:06,029 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:10:06,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2019-11-24 04:10:06,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c8464bd/8972ffde381c475aa0474403b111ead2/FLAG1d51a2a8d [2019-11-24 04:10:06,673 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:10:06,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2019-11-24 04:10:06,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c8464bd/8972ffde381c475aa0474403b111ead2/FLAG1d51a2a8d [2019-11-24 04:10:07,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c8464bd/8972ffde381c475aa0474403b111ead2 [2019-11-24 04:10:07,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:10:07,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:10:07,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:10:07,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:10:07,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:10:07,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252961a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07, skipping insertion in model container [2019-11-24 04:10:07,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:10:07,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:10:07,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:10:07,530 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:10:07,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:10:07,643 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:10:07,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07 WrapperNode [2019-11-24 04:10:07,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:10:07,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:10:07,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:10:07,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:10:07,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:10:07,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:10:07,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:10:07,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:10:07,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... [2019-11-24 04:10:07,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:10:07,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:10:07,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:10:07,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:10:07,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:10:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 04:10:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 04:10:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 04:10:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:10:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 04:10:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 04:10:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 04:10:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 04:10:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:10:07,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:10:08,827 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:10:08,828 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-24 04:10:08,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:10:08 BoogieIcfgContainer [2019-11-24 04:10:08,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:10:08,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:10:08,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:10:08,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:10:08,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:10:07" (1/3) ... [2019-11-24 04:10:08,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7751af46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:10:08, skipping insertion in model container [2019-11-24 04:10:08,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:10:07" (2/3) ... [2019-11-24 04:10:08,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7751af46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:10:08, skipping insertion in model container [2019-11-24 04:10:08,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:10:08" (3/3) ... [2019-11-24 04:10:08,839 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2019-11-24 04:10:08,849 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:10:08,857 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 04:10:08,869 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 04:10:08,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:10:08,901 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:10:08,901 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:10:08,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:10:08,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:10:08,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:10:08,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:10:08,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:10:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-24 04:10:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:10:08,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:10:08,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:10:08,930 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:10:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:10:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1624184418, now seen corresponding path program 1 times [2019-11-24 04:10:08,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:10:08,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031906951] [2019-11-24 04:10:08,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:10:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:10:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:10:09,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031906951] [2019-11-24 04:10:09,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:10:09,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:10:09,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183451631] [2019-11-24 04:10:09,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:10:09,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:10:09,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:10:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:10:09,226 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-24 04:10:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:10:09,247 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-11-24 04:10:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:10:09,248 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 04:10:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:10:09,261 INFO L225 Difference]: With dead ends: 28 [2019-11-24 04:10:09,262 INFO L226 Difference]: Without dead ends: 12 [2019-11-24 04:10:09,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:10:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-11-24 04:10:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-24 04:10:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-24 04:10:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-24 04:10:09,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 8 [2019-11-24 04:10:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:10:09,299 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-24 04:10:09,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:10:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2019-11-24 04:10:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:10:09,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:10:09,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:10:09,300 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:10:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:10:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1624170499, now seen corresponding path program 1 times [2019-11-24 04:10:09,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:10:09,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128864083] [2019-11-24 04:10:09,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:10:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:10:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:10:09,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128864083] [2019-11-24 04:10:09,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:10:09,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:10:09,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596221620] [2019-11-24 04:10:09,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:10:09,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:10:09,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:10:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:10:09,397 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. [2019-11-24 04:10:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:10:09,422 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-11-24 04:10:09,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:10:09,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-24 04:10:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:10:09,423 INFO L225 Difference]: With dead ends: 22 [2019-11-24 04:10:09,423 INFO L226 Difference]: Without dead ends: 14 [2019-11-24 04:10:09,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:10:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-24 04:10:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-24 04:10:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-24 04:10:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-24 04:10:09,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2019-11-24 04:10:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:10:09,429 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-24 04:10:09,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:10:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-11-24 04:10:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:10:09,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:10:09,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:10:09,430 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:10:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:10:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2005372561, now seen corresponding path program 1 times [2019-11-24 04:10:09,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:10:09,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019590701] [2019-11-24 04:10:09,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:10:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:10:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 04:10:09,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019590701] [2019-11-24 04:10:09,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:10:09,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:10:09,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890494572] [2019-11-24 04:10:09,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:10:09,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:10:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:10:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:10:09,555 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2019-11-24 04:10:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:10:09,618 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-11-24 04:10:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:10:09,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-24 04:10:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:10:09,619 INFO L225 Difference]: With dead ends: 20 [2019-11-24 04:10:09,620 INFO L226 Difference]: Without dead ends: 14 [2019-11-24 04:10:09,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:10:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-24 04:10:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-24 04:10:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-24 04:10:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-24 04:10:09,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2019-11-24 04:10:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:10:09,625 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-24 04:10:09,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:10:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-11-24 04:10:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:10:09,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:10:09,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:10:09,626 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:10:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:10:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1955048233, now seen corresponding path program 1 times [2019-11-24 04:10:09,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:10:09,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457262379] [2019-11-24 04:10:09,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:10:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:10:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:10:10,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457262379] [2019-11-24 04:10:10,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56334132] [2019-11-24 04:10:10,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:10:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:10:10,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 90 conjunts are in the unsatisfiable core [2019-11-24 04:10:10,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:10:10,571 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-24 04:10:10,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-24 04:10:10,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:10,622 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-11-24 04:10:10,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 04:10:10,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:35 [2019-11-24 04:10:10,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:10,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:10,868 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-24 04:10:10,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 111 [2019-11-24 04:10:10,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:10,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:10,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:10,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 76 [2019-11-24 04:10:10,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:10,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:10,991 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:10,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 76 [2019-11-24 04:10:10,993 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:11,206 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-11-24 04:10:11,207 INFO L567 ElimStorePlain]: treesize reduction 72, result has 64.4 percent of original size [2019-11-24 04:10:11,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-24 04:10:11,210 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:132, output treesize:130 [2019-11-24 04:10:11,364 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-24 04:10:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:11,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:11,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2019-11-24 04:10:11,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:11,660 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-24 04:10:11,662 INFO L567 ElimStorePlain]: treesize reduction 12, result has 93.3 percent of original size [2019-11-24 04:10:11,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:11,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2019-11-24 04:10:11,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:11,789 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-24 04:10:11,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:11,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:11,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2019-11-24 04:10:11,808 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:11,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:11,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-24 04:10:11,899 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:144 [2019-11-24 04:10:12,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:12,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,209 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:12,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 117 [2019-11-24 04:10:12,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:12,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:12,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 114 [2019-11-24 04:10:12,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:12,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:12,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 153 [2019-11-24 04:10:12,334 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:12,537 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-24 04:10:12,538 INFO L567 ElimStorePlain]: treesize reduction 97, result has 65.1 percent of original size [2019-11-24 04:10:12,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2019-11-24 04:10:12,555 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:12,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2019-11-24 04:10:12,564 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:12,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:12,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 04:10:12,644 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:303, output treesize:139 [2019-11-24 04:10:12,759 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_121|, |v_#memory_int_126|], 4=[|v_#memory_$Pointer$.offset_99|, |v_#memory_$Pointer$.base_99|]} [2019-11-24 04:10:12,770 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:12,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:12,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2019-11-24 04:10:12,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:12,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:12,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:12,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2019-11-24 04:10:12,934 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:12,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:13,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2019-11-24 04:10:13,013 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:13,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:13,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:13,061 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:153, output treesize:95 [2019-11-24 04:10:13,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:13,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:13,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:13,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:13,285 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_122|, |v_#memory_int_127|], 7=[|v_#memory_$Pointer$.offset_100|, |v_#memory_$Pointer$.base_100|]} [2019-11-24 04:10:13,294 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:13,299 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:13,498 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-24 04:10:13,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:13,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 187 [2019-11-24 04:10:13,549 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:13,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 191 [2019-11-24 04:10:13,567 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:13,701 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-24 04:10:13,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:13,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 124 [2019-11-24 04:10:13,725 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:13,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 128 [2019-11-24 04:10:13,739 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:13,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:13,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,843 INFO L377 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 82 treesize of output 54 [2019-11-24 04:10:13,845 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:13,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:13,853 INFO L377 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 105 treesize of output 69 [2019-11-24 04:10:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:13,857 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:13,970 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-11-24 04:10:13,971 INFO L567 ElimStorePlain]: treesize reduction 9, result has 91.0 percent of original size [2019-11-24 04:10:13,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 04:10:13,973 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:435, output treesize:39 [2019-11-24 04:10:14,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-11-24 04:10:14,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:14,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:14,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 04:10:14,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-24 04:10:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:10:14,079 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:10:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:14,120 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:14,129 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:14,680 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-11-24 04:10:14,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:14,685 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:14,918 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2019-11-24 04:10:14,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:14,946 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:14,954 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:15,837 WARN L192 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-11-24 04:10:15,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:15,867 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:15,876 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:16,569 WARN L192 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-11-24 04:10:16,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:16,576 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:17,114 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-11-24 04:10:17,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:17,122 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:17,133 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:17,450 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-11-24 04:10:17,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:17,457 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:17,465 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:17,739 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-11-24 04:10:17,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:17,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 7 dim-2 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-11-24 04:10:17,741 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:1319, output treesize:1343 [2019-11-24 04:10:35,425 WARN L192 SmtUtils]: Spent 14.24 s on a formula simplification that was a NOOP. DAG size: 201 [2019-11-24 04:10:35,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 04:11:23,233 WARN L192 SmtUtils]: Spent 32.44 s on a formula simplification that was a NOOP. DAG size: 204 [2019-11-24 04:11:23,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 04:11:23,271 INFO L392 ElimStorePlain]: Different costs {22=[|v_#memory_$Pointer$.offset_102|, |v_#memory_$Pointer$.base_102|], 33=[|v_#memory_int_121|]} [2019-11-24 04:11:23,285 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:23,293 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:23,320 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:23,341 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:25,603 WARN L192 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 200 DAG size of output: 199 [2019-11-24 04:11:25,604 INFO L567 ElimStorePlain]: treesize reduction 20, result has 98.8 percent of original size [2019-11-24 04:11:25,622 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:25,636 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:25,664 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:25,684 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:27,511 WARN L192 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 215 [2019-11-24 04:11:27,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:11:27,547 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:27,571 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:27,632 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:27,645 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:11:28,800 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 220 [2019-11-24 04:11:28,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:11:28,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 3 dim-2 vars, End of recursive call: 39 dim-0 vars, and 4 xjuncts. [2019-11-24 04:11:28,804 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 24 variables, input treesize:1300, output treesize:2289 [2019-11-24 04:11:30,814 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_22 Int) (ULTIMATE.start_node_create_~temp~0.offset Int) (v_prenex_11 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_6 Int) (ULTIMATE.start_node_create_~data Int)) (let ((.cse1 (+ ULTIMATE.start_node_create_~temp~0.offset 4))) (let ((.cse5 (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_node_create_~temp~0.offset 0) .cse1 v_DerPreprocessor_18)) (.cse3 (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_node_create_~temp~0.offset 0) .cse1 v_DerPreprocessor_22))) (or (= c_ULTIMATE.start_main_~data~0 (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base (store (store (store (select |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_node_create_~temp~0.offset v_DerPreprocessor_26) .cse1 ULTIMATE.start_node_create_~data) v_prenex_11 v_DerPreprocessor_11)))) (store .cse0 c_ULTIMATE.start_sll_circular_insert_~head.base (store (select .cse0 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset v_DerPreprocessor_6))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store .cse3 v_prenex_11 c_ULTIMATE.start_node_create_~temp~0.base)))) (store .cse2 c_ULTIMATE.start_sll_circular_insert_~head.base (store (select .cse2 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset c_ULTIMATE.start_node_create_~temp~0.base))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|)) (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store .cse5 v_prenex_11 v_prenex_11)))) (store .cse4 c_ULTIMATE.start_sll_circular_insert_~head.base (store (select .cse4 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset v_prenex_11))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|) 4))) (not (= 0 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base .cse5) c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base .cse3) c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset))))))) (forall ((v_DerPreprocessor_24 Int) (v_prenex_15 Int) (v_DerPreprocessor_14 Int) (v_prenex_18 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_20 Int) (v_prenex_19 Int)) (let ((.cse10 (+ v_prenex_18 4))) (let ((.cse17 (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_18 0) .cse10 v_DerPreprocessor_16)) (.cse15 (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_18 0) .cse10 v_DerPreprocessor_20))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base .cse15) c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset)) (.cse18 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base .cse17) c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset))) (or (= (let ((.cse14 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store .cse17 v_prenex_15 .cse18))) (.cse12 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store .cse15 v_prenex_15 .cse16)))) (let ((.cse8 (select (select .cse12 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset)) (.cse9 (select (select .cse14 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset))) (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base (store (store (store (select |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_18 v_DerPreprocessor_24) .cse10 v_prenex_19) v_prenex_15 v_DerPreprocessor_9)))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_DerPreprocessor_14))))) (store .cse6 c_ULTIMATE.start_sll_circular_insert_~head.base (store (select .cse6 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset v_DerPreprocessor_4))) (select (select (let ((.cse11 (store .cse12 .cse8 (store (select .cse12 .cse8) .cse9 c_ULTIMATE.start_node_create_~temp~0.base)))) (store .cse11 c_ULTIMATE.start_sll_circular_insert_~head.base (store (select .cse11 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset c_ULTIMATE.start_node_create_~temp~0.base))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|)) (+ (select (select (let ((.cse13 (store .cse14 .cse8 (store (select .cse14 .cse8) .cse9 v_prenex_15)))) (store .cse13 c_ULTIMATE.start_sll_circular_insert_~head.base (store (select .cse13 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset v_prenex_15))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|) 4)))) c_ULTIMATE.start_main_~data~0) (< .cse18 0) (not (= 0 .cse16)) (= .cse18 0)))))) (forall ((v_prenex_16 Int) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int) (v_prenex_17 Int) (v_DerPreprocessor_12 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_19 Int) (v_subst_2 Int) (ULTIMATE.start_sll_circular_insert_~new_node~0.offset Int)) (let ((.cse22 (+ v_prenex_22 4))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_22 0) .cse22 v_DerPreprocessor_19)))) (or (= 0 v_prenex_17) (= c_ULTIMATE.start_main_~data~0 (let ((.cse24 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_22 0) .cse22 v_DerPreprocessor_23)))) (let ((.cse21 (select (select .cse24 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset))) (select (select (let ((.cse19 (let ((.cse20 (store |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_22 v_DerPreprocessor_25) .cse22 v_prenex_23)))) (store .cse20 .cse21 (store (select .cse20 .cse21) v_prenex_17 v_DerPreprocessor_7))))) (store .cse19 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse19 c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_sll_circular_insert_~new_node~0.offset v_DerPreprocessor_12))) (select (select (let ((.cse23 (store .cse24 .cse21 (store (select .cse24 .cse21) v_prenex_17 c_ULTIMATE.start_node_create_~temp~0.base)))) (store .cse23 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse23 c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_sll_circular_insert_~new_node~0.offset v_subst_2))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|)) (+ (select (select (let ((.cse25 (store .cse26 .cse21 (store (select .cse26 .cse21) v_prenex_17 ULTIMATE.start_sll_circular_insert_~new_node~0.offset)))) (store .cse25 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse25 c_ULTIMATE.start_node_create_~temp~0.base) ULTIMATE.start_sll_circular_insert_~new_node~0.offset v_prenex_16))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|) 4))))) (< (select (select .cse26 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset) v_prenex_17))))) (forall ((v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0.offset_20 Int) (v_DerPreprocessor_13 Int) (v_prenex_12 Int) (v_DerPreprocessor_17 Int) (v_prenex_14 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_8 Int) (v_prenex_13 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_DerPreprocessor_21 Int)) (let ((.cse31 (+ v_prenex_20 4))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_20 0) .cse31 v_DerPreprocessor_21)))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_20 0) .cse31 v_DerPreprocessor_17))) (.cse27 (select (select .cse33 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset))) (or (= 0 .cse27) (< (select (select .cse28 c_ULTIMATE.start_sll_circular_insert_~head.base) c_ULTIMATE.start_sll_circular_insert_~head.offset) v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0.offset_20) (= (select (select (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base (store (store (select |c_#memory_int| c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_20 v_DerPreprocessor_27) .cse31 v_prenex_21)))) (store .cse30 .cse27 (store (select .cse30 .cse27) v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0.offset_20 v_DerPreprocessor_8))))) (store .cse29 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse29 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_13 v_DerPreprocessor_13))) (select (select (let ((.cse32 (store .cse33 .cse27 (store (select .cse33 .cse27) v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0.offset_20 c_ULTIMATE.start_node_create_~temp~0.base)))) (store .cse32 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse32 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_13 v_prenex_12))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|)) (+ (select (select (let ((.cse34 (store .cse28 .cse27 (store (select .cse28 .cse27) v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0.offset_20 v_prenex_13)))) (store .cse34 c_ULTIMATE.start_node_create_~temp~0.base (store (select .cse34 c_ULTIMATE.start_node_create_~temp~0.base) v_prenex_13 v_prenex_14))) |c_ULTIMATE.start_main_~#s~0.base|) |c_ULTIMATE.start_main_~#s~0.offset|) 4)) c_ULTIMATE.start_main_~data~0))))))) is different from false [2019-11-24 04:11:31,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 04:11:31,296 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_103|, |v_#memory_$Pointer$.base_103|], 37=[|v_#memory_int_130|]} [2019-11-24 04:11:31,347 INFO L377 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 41403 treesize of output 41359 [2019-11-24 04:11:31,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:11:33,854 INFO L377 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 188 treesize of output 180 [2019-11-24 04:11:33,855 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:11:34,198 INFO L377 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 21736 treesize of output 21708 [2019-11-24 04:11:34,205 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:11:34,796 INFO L377 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 85684 treesize of output 84832 [2019-11-24 04:11:34,807 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.