java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:59:01,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:59:01,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:59:01,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:59:01,702 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:59:01,703 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:59:01,704 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:59:01,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:59:01,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:59:01,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:59:01,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:59:01,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:59:01,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:59:01,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:59:01,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:59:01,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:59:01,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:59:01,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:59:01,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:59:01,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:59:01,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:59:01,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:59:01,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:59:01,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:59:01,752 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:59:01,753 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:59:01,754 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:59:01,754 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:59:01,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:59:01,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:59:01,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:59:01,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:59:01,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:59:01,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:59:01,766 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:59:01,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:59:01,768 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:59:01,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:59:01,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:59:01,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:59:01,798 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:59:01,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:59:01,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:59:01,799 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:59:01,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:59:01,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:59:01,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:59:01,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:59:01,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:59:01,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:59:01,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:59:01,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:59:01,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:59:01,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:59:01,802 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:59:01,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:59:01,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:59:01,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:59:01,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:59:01,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:59:01,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:59:01,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:59:01,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:59:01,803 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:59:01,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:59:01,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:59:01,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:59:01,804 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:59:01,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:59:01,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:59:01,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:59:01,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:59:01,868 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:59:01,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:01,932 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0ce0b80/6499efc671f043bd912b966714e5cef7/FLAG70cf26456 [2018-11-23 12:59:02,441 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:59:02,442 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:02,466 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0ce0b80/6499efc671f043bd912b966714e5cef7/FLAG70cf26456 [2018-11-23 12:59:02,729 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0ce0b80/6499efc671f043bd912b966714e5cef7 [2018-11-23 12:59:02,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:59:02,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:59:02,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:59:02,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:59:02,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:59:02,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:59:02" (1/1) ... [2018-11-23 12:59:02,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63659622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:02, skipping insertion in model container [2018-11-23 12:59:02,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:59:02" (1/1) ... [2018-11-23 12:59:02,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:59:02,813 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:59:03,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:59:03,267 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:59:03,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:59:03,404 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:59:03,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03 WrapperNode [2018-11-23 12:59:03,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:59:03,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:59:03,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:59:03,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:59:03,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:59:03,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:59:03,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:59:03,518 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:59:03,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (1/1) ... [2018-11-23 12:59:03,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:59:03,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:59:03,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:59:03,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:59:03,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (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 [2018-11-23 12:59:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 12:59:03,627 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 12:59:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:59:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:59:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:59:03,628 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:59:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 12:59:03,628 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 12:59:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:59:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 12:59:03,629 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 12:59:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:59:03,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:59:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:59:03,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:59:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:59:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:59:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:59:03,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:59:03,631 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-23 12:59:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-23 12:59:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:59:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:59:04,666 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:59:04,666 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:59:04,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:59:04 BoogieIcfgContainer [2018-11-23 12:59:04,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:59:04,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:59:04,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:59:04,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:59:04,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:59:02" (1/3) ... [2018-11-23 12:59:04,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da50d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:59:04, skipping insertion in model container [2018-11-23 12:59:04,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:59:03" (2/3) ... [2018-11-23 12:59:04,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da50d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:59:04, skipping insertion in model container [2018-11-23 12:59:04,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:59:04" (3/3) ... [2018-11-23 12:59:04,675 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 12:59:04,686 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:59:04,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:59:04,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:59:04,741 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:59:04,742 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:59:04,742 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:59:04,742 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:59:04,742 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:59:04,742 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:59:04,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:59:04,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:59:04,743 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:59:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-23 12:59:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:59:04,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:04,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:04,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:04,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash -39006613, now seen corresponding path program 1 times [2018-11-23 12:59:04,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:04,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:04,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2018-11-23 12:59:05,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52#true} is VALID [2018-11-23 12:59:05,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-23 12:59:05,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #118#return; {52#true} is VALID [2018-11-23 12:59:05,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret16 := main(); {52#true} is VALID [2018-11-23 12:59:05,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {52#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {52#true} is VALID [2018-11-23 12:59:05,004 INFO L256 TraceCheckUtils]: 6: Hoare triple {52#true} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {52#true} is VALID [2018-11-23 12:59:05,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {52#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {52#true} is VALID [2018-11-23 12:59:05,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {52#true} assume !true; {53#false} is VALID [2018-11-23 12:59:05,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {53#false} is VALID [2018-11-23 12:59:05,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-23 12:59:05,018 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {53#false} {52#true} #108#return; {53#false} is VALID [2018-11-23 12:59:05,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {53#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset; {53#false} is VALID [2018-11-23 12:59:05,019 INFO L256 TraceCheckUtils]: 13: Hoare triple {53#false} call sll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {52#true} is VALID [2018-11-23 12:59:05,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {52#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {52#true} is VALID [2018-11-23 12:59:05,020 INFO L256 TraceCheckUtils]: 15: Hoare triple {52#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {52#true} is VALID [2018-11-23 12:59:05,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {52#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {52#true} is VALID [2018-11-23 12:59:05,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {52#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {52#true} is VALID [2018-11-23 12:59:05,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {52#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {52#true} is VALID [2018-11-23 12:59:05,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-23 12:59:05,021 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {52#true} {52#true} #116#return; {52#true} is VALID [2018-11-23 12:59:05,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {52#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {52#true} is VALID [2018-11-23 12:59:05,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {52#true} assume !(~index > 0); {52#true} is VALID [2018-11-23 12:59:05,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {52#true} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4); {52#true} is VALID [2018-11-23 12:59:05,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {52#true} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {52#true} is VALID [2018-11-23 12:59:05,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-23 12:59:05,024 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {52#true} {53#false} #110#return; {53#false} is VALID [2018-11-23 12:59:05,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {53#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {53#false} is VALID [2018-11-23 12:59:05,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {53#false} assume !true; {53#false} is VALID [2018-11-23 12:59:05,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {53#false} assume ~count~0 != 1 + ~len~0; {53#false} is VALID [2018-11-23 12:59:05,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {53#false} assume !false; {53#false} is VALID [2018-11-23 12:59:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:05,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:05,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:59:05,040 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 12:59:05,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:05,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:59:05,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:05,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:59:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:59:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:59:05,256 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-23 12:59:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:05,617 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2018-11-23 12:59:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:59:05,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-23 12:59:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:59:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2018-11-23 12:59:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:59:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2018-11-23 12:59:05,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 109 transitions. [2018-11-23 12:59:06,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:06,245 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:59:06,245 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:59:06,249 INFO L631 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 [2018-11-23 12:59:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:59:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:59:06,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:06,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 12:59:06,305 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:59:06,305 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:59:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:06,311 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 12:59:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:59:06,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:06,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:06,313 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:59:06,313 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:59:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:06,319 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 12:59:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:59:06,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:06,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:06,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:06,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:59:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 12:59:06,326 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 31 [2018-11-23 12:59:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:06,327 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 12:59:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:59:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:59:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:59:06,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:06,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:06,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:06,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1407196518, now seen corresponding path program 1 times [2018-11-23 12:59:06,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:06,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:06,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:06,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:06,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:06,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-23 12:59:06,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {299#true} is VALID [2018-11-23 12:59:06,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 12:59:06,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #118#return; {299#true} is VALID [2018-11-23 12:59:06,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret16 := main(); {299#true} is VALID [2018-11-23 12:59:06,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {299#true} is VALID [2018-11-23 12:59:06,673 INFO L256 TraceCheckUtils]: 6: Hoare triple {299#true} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {299#true} is VALID [2018-11-23 12:59:06,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {299#true} is VALID [2018-11-23 12:59:06,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {299#true} assume !(~len > 0); {299#true} is VALID [2018-11-23 12:59:06,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {299#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {299#true} is VALID [2018-11-23 12:59:06,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 12:59:06,675 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {299#true} {299#true} #108#return; {299#true} is VALID [2018-11-23 12:59:06,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {299#true} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset; {299#true} is VALID [2018-11-23 12:59:06,675 INFO L256 TraceCheckUtils]: 13: Hoare triple {299#true} call sll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {299#true} is VALID [2018-11-23 12:59:06,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {299#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {299#true} is VALID [2018-11-23 12:59:06,676 INFO L256 TraceCheckUtils]: 15: Hoare triple {299#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {299#true} is VALID [2018-11-23 12:59:06,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {299#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {299#true} is VALID [2018-11-23 12:59:06,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {299#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {299#true} is VALID [2018-11-23 12:59:06,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {299#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {299#true} is VALID [2018-11-23 12:59:06,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-23 12:59:06,677 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {299#true} {299#true} #116#return; {299#true} is VALID [2018-11-23 12:59:06,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {299#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {301#(and (= sll_insert_~snd_to_last~0.base 0) (= sll_insert_~snd_to_last~0.offset 0))} is VALID [2018-11-23 12:59:06,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {301#(and (= sll_insert_~snd_to_last~0.base 0) (= sll_insert_~snd_to_last~0.offset 0))} assume !(~index > 0); {301#(and (= sll_insert_~snd_to_last~0.base 0) (= sll_insert_~snd_to_last~0.offset 0))} is VALID [2018-11-23 12:59:06,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {301#(and (= sll_insert_~snd_to_last~0.base 0) (= sll_insert_~snd_to_last~0.offset 0))} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4); {300#false} is VALID [2018-11-23 12:59:06,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {300#false} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {300#false} is VALID [2018-11-23 12:59:06,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {300#false} assume true; {300#false} is VALID [2018-11-23 12:59:06,688 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {300#false} {299#true} #110#return; {300#false} is VALID [2018-11-23 12:59:06,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {300#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {300#false} is VALID [2018-11-23 12:59:06,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {300#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {300#false} is VALID [2018-11-23 12:59:06,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {300#false} assume ~count~0 != 1 + ~len~0; {300#false} is VALID [2018-11-23 12:59:06,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-23 12:59:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:06,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:06,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:59:06,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:59:06,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:06,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:59:06,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:06,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:59:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:59:06,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:59:06,782 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2018-11-23 12:59:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:06,973 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:59:06,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:59:06,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:59:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:59:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:59:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:59:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:59:06,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 12:59:07,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:07,129 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:59:07,130 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:59:07,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:59:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:59:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 12:59:07,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:07,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 12:59:07,160 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 12:59:07,160 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 12:59:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:07,164 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:59:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:59:07,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:07,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:07,166 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 12:59:07,166 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 12:59:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:07,170 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:59:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:59:07,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:07,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:07,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:07,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:59:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-23 12:59:07,175 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 31 [2018-11-23 12:59:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:07,176 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-23 12:59:07,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:59:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:59:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:59:07,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:07,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:07,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:07,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2078424152, now seen corresponding path program 1 times [2018-11-23 12:59:07,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:07,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:07,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:07,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-23 12:59:07,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {508#true} is VALID [2018-11-23 12:59:07,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-23 12:59:07,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} #118#return; {508#true} is VALID [2018-11-23 12:59:07,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {508#true} call #t~ret16 := main(); {508#true} is VALID [2018-11-23 12:59:07,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {508#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {510#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:07,370 INFO L256 TraceCheckUtils]: 6: Hoare triple {510#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {508#true} is VALID [2018-11-23 12:59:07,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {508#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {511#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:07,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {511#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {512#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:07,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {512#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:07,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#(<= |sll_create_#in~len| 0)} assume true; {512#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 12:59:07,391 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {512#(<= |sll_create_#in~len| 0)} {510#(<= 2 main_~len~0)} #108#return; {509#false} is VALID [2018-11-23 12:59:07,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {509#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset; {509#false} is VALID [2018-11-23 12:59:07,391 INFO L256 TraceCheckUtils]: 13: Hoare triple {509#false} call sll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {508#true} is VALID [2018-11-23 12:59:07,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {508#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {508#true} is VALID [2018-11-23 12:59:07,392 INFO L256 TraceCheckUtils]: 15: Hoare triple {508#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {508#true} is VALID [2018-11-23 12:59:07,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {508#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {508#true} is VALID [2018-11-23 12:59:07,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {508#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {508#true} is VALID [2018-11-23 12:59:07,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {508#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {508#true} is VALID [2018-11-23 12:59:07,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-23 12:59:07,394 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {508#true} {508#true} #116#return; {508#true} is VALID [2018-11-23 12:59:07,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {508#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {508#true} is VALID [2018-11-23 12:59:07,394 INFO L273 TraceCheckUtils]: 22: Hoare triple {508#true} assume !(~index > 0); {508#true} is VALID [2018-11-23 12:59:07,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {508#true} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {508#true} is VALID [2018-11-23 12:59:07,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {508#true} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {508#true} is VALID [2018-11-23 12:59:07,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-23 12:59:07,396 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {508#true} {509#false} #110#return; {509#false} is VALID [2018-11-23 12:59:07,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {509#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {509#false} is VALID [2018-11-23 12:59:07,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {509#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {509#false} is VALID [2018-11-23 12:59:07,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {509#false} assume ~count~0 != 1 + ~len~0; {509#false} is VALID [2018-11-23 12:59:07,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-23 12:59:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:59:07,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:07,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:59:07,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:59:07,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:07,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:59:07,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:07,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:59:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:59:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:59:07,529 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 5 states. [2018-11-23 12:59:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:07,870 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 12:59:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:59:07,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 12:59:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:59:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:59:07,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 12:59:08,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:08,013 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:59:08,013 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:59:08,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:59:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 12:59:08,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:08,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-23 12:59:08,042 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-23 12:59:08,042 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-23 12:59:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:08,047 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:59:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:59:08,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:08,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:08,048 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-23 12:59:08,048 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-23 12:59:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:08,052 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:59:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:59:08,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:08,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:08,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:08,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:59:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 12:59:08,056 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 31 [2018-11-23 12:59:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:08,056 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:59:08,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:59:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:59:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:59:08,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:08,058 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:08,059 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:08,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 260466119, now seen corresponding path program 1 times [2018-11-23 12:59:08,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:08,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:08,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:08,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:08,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:08,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {751#true} call ULTIMATE.init(); {751#true} is VALID [2018-11-23 12:59:08,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {751#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {751#true} is VALID [2018-11-23 12:59:08,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {751#true} assume true; {751#true} is VALID [2018-11-23 12:59:08,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {751#true} {751#true} #118#return; {751#true} is VALID [2018-11-23 12:59:08,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {751#true} call #t~ret16 := main(); {751#true} is VALID [2018-11-23 12:59:08,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {751#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {753#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:08,252 INFO L256 TraceCheckUtils]: 6: Hoare triple {753#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {751#true} is VALID [2018-11-23 12:59:08,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {751#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {751#true} is VALID [2018-11-23 12:59:08,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {751#true} assume !!(~len > 0); {751#true} is VALID [2018-11-23 12:59:08,253 INFO L256 TraceCheckUtils]: 9: Hoare triple {751#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {751#true} is VALID [2018-11-23 12:59:08,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {751#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {751#true} is VALID [2018-11-23 12:59:08,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {751#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {751#true} is VALID [2018-11-23 12:59:08,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {751#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {751#true} is VALID [2018-11-23 12:59:08,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {751#true} assume true; {751#true} is VALID [2018-11-23 12:59:08,255 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {751#true} {751#true} #114#return; {751#true} is VALID [2018-11-23 12:59:08,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {751#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {751#true} is VALID [2018-11-23 12:59:08,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {751#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {751#true} is VALID [2018-11-23 12:59:08,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {751#true} assume !(~len > 0); {751#true} is VALID [2018-11-23 12:59:08,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {751#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {751#true} is VALID [2018-11-23 12:59:08,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {751#true} assume true; {751#true} is VALID [2018-11-23 12:59:08,260 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {751#true} {753#(<= 2 main_~len~0)} #108#return; {753#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:08,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {753#(<= 2 main_~len~0)} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset; {753#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:08,261 INFO L256 TraceCheckUtils]: 22: Hoare triple {753#(<= 2 main_~len~0)} call sll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {751#true} is VALID [2018-11-23 12:59:08,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {754#(= sll_insert_~index |sll_insert_#in~index|)} is VALID [2018-11-23 12:59:08,266 INFO L256 TraceCheckUtils]: 24: Hoare triple {754#(= sll_insert_~index |sll_insert_#in~index|)} call #t~ret6.base, #t~ret6.offset := node_create(~data); {751#true} is VALID [2018-11-23 12:59:08,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {751#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {751#true} is VALID [2018-11-23 12:59:08,267 INFO L273 TraceCheckUtils]: 26: Hoare triple {751#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {751#true} is VALID [2018-11-23 12:59:08,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {751#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {751#true} is VALID [2018-11-23 12:59:08,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {751#true} assume true; {751#true} is VALID [2018-11-23 12:59:08,283 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {751#true} {754#(= sll_insert_~index |sll_insert_#in~index|)} #116#return; {754#(= sll_insert_~index |sll_insert_#in~index|)} is VALID [2018-11-23 12:59:08,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {754#(= sll_insert_~index |sll_insert_#in~index|)} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {754#(= sll_insert_~index |sll_insert_#in~index|)} is VALID [2018-11-23 12:59:08,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {754#(= sll_insert_~index |sll_insert_#in~index|)} assume !(~index > 0); {755#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:08,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {755#(<= |sll_insert_#in~index| 0)} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {755#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:08,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {755#(<= |sll_insert_#in~index| 0)} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {755#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:08,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {755#(<= |sll_insert_#in~index| 0)} assume true; {755#(<= |sll_insert_#in~index| 0)} is VALID [2018-11-23 12:59:08,302 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {755#(<= |sll_insert_#in~index| 0)} {753#(<= 2 main_~len~0)} #110#return; {752#false} is VALID [2018-11-23 12:59:08,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {752#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {752#false} is VALID [2018-11-23 12:59:08,303 INFO L273 TraceCheckUtils]: 37: Hoare triple {752#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {752#false} is VALID [2018-11-23 12:59:08,303 INFO L273 TraceCheckUtils]: 38: Hoare triple {752#false} assume ~count~0 != 1 + ~len~0; {752#false} is VALID [2018-11-23 12:59:08,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {752#false} assume !false; {752#false} is VALID [2018-11-23 12:59:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:59:08,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:59:08,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:59:08,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-23 12:59:08,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:08,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:59:08,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:08,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:59:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:59:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:59:08,422 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 5 states. [2018-11-23 12:59:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:08,737 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 12:59:08,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:59:08,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-23 12:59:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:59:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:59:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:59:08,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-23 12:59:08,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:08,860 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:59:08,861 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:59:08,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:59:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:59:08,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:08,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 12:59:08,902 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:59:08,902 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:59:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:08,905 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 12:59:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 12:59:08,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:08,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:08,906 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:59:08,906 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:59:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:08,909 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 12:59:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 12:59:08,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:08,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:08,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:08,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:59:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 12:59:08,913 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 40 [2018-11-23 12:59:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:08,913 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 12:59:08,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:59:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 12:59:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:59:08,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:08,915 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:08,916 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:08,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 328329607, now seen corresponding path program 1 times [2018-11-23 12:59:08,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:08,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:08,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:09,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {958#true} call ULTIMATE.init(); {958#true} is VALID [2018-11-23 12:59:09,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {958#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {958#true} is VALID [2018-11-23 12:59:09,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 12:59:09,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {958#true} {958#true} #118#return; {958#true} is VALID [2018-11-23 12:59:09,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {958#true} call #t~ret16 := main(); {958#true} is VALID [2018-11-23 12:59:09,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {958#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {960#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:09,070 INFO L256 TraceCheckUtils]: 6: Hoare triple {960#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {958#true} is VALID [2018-11-23 12:59:09,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {958#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,073 INFO L256 TraceCheckUtils]: 9: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {958#true} is VALID [2018-11-23 12:59:09,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {958#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {958#true} is VALID [2018-11-23 12:59:09,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {958#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {958#true} is VALID [2018-11-23 12:59:09,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {958#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {958#true} is VALID [2018-11-23 12:59:09,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 12:59:09,076 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {958#true} {961#(<= |sll_create_#in~len| sll_create_~len)} #114#return; {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {962#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:09,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {962#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {963#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:09,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {963#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {963#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:09,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {963#(<= |sll_create_#in~len| 1)} assume true; {963#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:09,082 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {963#(<= |sll_create_#in~len| 1)} {960#(<= 2 main_~len~0)} #108#return; {959#false} is VALID [2018-11-23 12:59:09,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {959#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset; {959#false} is VALID [2018-11-23 12:59:09,083 INFO L256 TraceCheckUtils]: 22: Hoare triple {959#false} call sll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {958#true} is VALID [2018-11-23 12:59:09,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {958#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {958#true} is VALID [2018-11-23 12:59:09,083 INFO L256 TraceCheckUtils]: 24: Hoare triple {958#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {958#true} is VALID [2018-11-23 12:59:09,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {958#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {958#true} is VALID [2018-11-23 12:59:09,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {958#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {958#true} is VALID [2018-11-23 12:59:09,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {958#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {958#true} is VALID [2018-11-23 12:59:09,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 12:59:09,084 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {958#true} {958#true} #116#return; {958#true} is VALID [2018-11-23 12:59:09,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {958#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {958#true} is VALID [2018-11-23 12:59:09,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {958#true} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {958#true} is VALID [2018-11-23 12:59:09,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {958#true} assume !(~index > 0); {958#true} is VALID [2018-11-23 12:59:09,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {958#true} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4); {958#true} is VALID [2018-11-23 12:59:09,085 INFO L273 TraceCheckUtils]: 34: Hoare triple {958#true} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {958#true} is VALID [2018-11-23 12:59:09,086 INFO L273 TraceCheckUtils]: 35: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 12:59:09,086 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {958#true} {959#false} #110#return; {959#false} is VALID [2018-11-23 12:59:09,086 INFO L273 TraceCheckUtils]: 37: Hoare triple {959#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {959#false} is VALID [2018-11-23 12:59:09,086 INFO L273 TraceCheckUtils]: 38: Hoare triple {959#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {959#false} is VALID [2018-11-23 12:59:09,086 INFO L273 TraceCheckUtils]: 39: Hoare triple {959#false} assume ~count~0 != 1 + ~len~0; {959#false} is VALID [2018-11-23 12:59:09,087 INFO L273 TraceCheckUtils]: 40: Hoare triple {959#false} assume !false; {959#false} is VALID [2018-11-23 12:59:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:59:09,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:09,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:09,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:09,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {958#true} call ULTIMATE.init(); {958#true} is VALID [2018-11-23 12:59:09,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {958#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {958#true} is VALID [2018-11-23 12:59:09,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 12:59:09,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {958#true} {958#true} #118#return; {958#true} is VALID [2018-11-23 12:59:09,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {958#true} call #t~ret16 := main(); {958#true} is VALID [2018-11-23 12:59:09,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {958#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {960#(<= 2 main_~len~0)} is VALID [2018-11-23 12:59:09,628 INFO L256 TraceCheckUtils]: 6: Hoare triple {960#(<= 2 main_~len~0)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {958#true} is VALID [2018-11-23 12:59:09,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {958#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,629 INFO L256 TraceCheckUtils]: 9: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {958#true} is VALID [2018-11-23 12:59:09,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {958#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {958#true} is VALID [2018-11-23 12:59:09,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {958#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {958#true} is VALID [2018-11-23 12:59:09,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {958#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {958#true} is VALID [2018-11-23 12:59:09,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 12:59:09,632 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {958#true} {961#(<= |sll_create_#in~len| sll_create_~len)} #114#return; {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,632 INFO L273 TraceCheckUtils]: 15: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {961#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 12:59:09,633 INFO L273 TraceCheckUtils]: 16: Hoare triple {961#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {962#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 12:59:09,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {962#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {963#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:09,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {963#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {963#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:09,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {963#(<= |sll_create_#in~len| 1)} assume true; {963#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 12:59:09,639 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {963#(<= |sll_create_#in~len| 1)} {960#(<= 2 main_~len~0)} #108#return; {959#false} is VALID [2018-11-23 12:59:09,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {959#false} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset; {959#false} is VALID [2018-11-23 12:59:09,640 INFO L256 TraceCheckUtils]: 22: Hoare triple {959#false} call sll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {959#false} is VALID [2018-11-23 12:59:09,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {959#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {959#false} is VALID [2018-11-23 12:59:09,640 INFO L256 TraceCheckUtils]: 24: Hoare triple {959#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {959#false} is VALID [2018-11-23 12:59:09,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {959#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {959#false} is VALID [2018-11-23 12:59:09,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {959#false} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {959#false} is VALID [2018-11-23 12:59:09,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {959#false} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {959#false} is VALID [2018-11-23 12:59:09,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {959#false} assume true; {959#false} is VALID [2018-11-23 12:59:09,642 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {959#false} {959#false} #116#return; {959#false} is VALID [2018-11-23 12:59:09,642 INFO L273 TraceCheckUtils]: 30: Hoare triple {959#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {959#false} is VALID [2018-11-23 12:59:09,642 INFO L273 TraceCheckUtils]: 31: Hoare triple {959#false} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {959#false} is VALID [2018-11-23 12:59:09,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {959#false} assume !(~index > 0); {959#false} is VALID [2018-11-23 12:59:09,643 INFO L273 TraceCheckUtils]: 33: Hoare triple {959#false} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4); {959#false} is VALID [2018-11-23 12:59:09,643 INFO L273 TraceCheckUtils]: 34: Hoare triple {959#false} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {959#false} is VALID [2018-11-23 12:59:09,643 INFO L273 TraceCheckUtils]: 35: Hoare triple {959#false} assume true; {959#false} is VALID [2018-11-23 12:59:09,644 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {959#false} {959#false} #110#return; {959#false} is VALID [2018-11-23 12:59:09,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {959#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {959#false} is VALID [2018-11-23 12:59:09,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {959#false} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {959#false} is VALID [2018-11-23 12:59:09,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {959#false} assume ~count~0 != 1 + ~len~0; {959#false} is VALID [2018-11-23 12:59:09,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {959#false} assume !false; {959#false} is VALID [2018-11-23 12:59:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:09,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:59:09,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:59:09,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 12:59:09,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:59:09,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:59:09,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:09,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:59:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:59:09,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:59:09,866 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 6 states. [2018-11-23 12:59:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:10,363 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-23 12:59:10,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:59:10,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 12:59:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:59:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:59:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:59:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:59:10,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 12:59:10,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:59:10,521 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:59:10,521 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:59:10,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:59:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:59:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 12:59:10,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:59:10,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 12:59:10,553 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 12:59:10,554 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 12:59:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:10,557 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:59:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:59:10,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:10,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:10,559 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 12:59:10,559 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 12:59:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:59:10,562 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:59:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:59:10,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:59:10,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:59:10,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:59:10,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:59:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:59:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 12:59:10,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2018-11-23 12:59:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:59:10,566 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 12:59:10,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:59:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:59:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:59:10,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:59:10,568 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:59:10,569 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:59:10,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:59:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1711254474, now seen corresponding path program 2 times [2018-11-23 12:59:10,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:59:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:59:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:59:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:59:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:13,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {1337#true} call ULTIMATE.init(); {1337#true} is VALID [2018-11-23 12:59:13,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {1337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1337#true} is VALID [2018-11-23 12:59:13,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {1337#true} assume true; {1337#true} is VALID [2018-11-23 12:59:13,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} #118#return; {1337#true} is VALID [2018-11-23 12:59:13,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {1337#true} call #t~ret16 := main(); {1337#true} is VALID [2018-11-23 12:59:13,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {1337#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1339#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-23 12:59:13,092 INFO L256 TraceCheckUtils]: 6: Hoare triple {1339#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret10.base, #t~ret10.offset := sll_create(~len~0, ~data~0); {1340#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:13,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {1340#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1340#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:13,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {1340#(= |#valid| |old(#valid)|)} assume !!(~len > 0); {1340#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:13,093 INFO L256 TraceCheckUtils]: 9: Hoare triple {1340#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1340#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:13,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {1340#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,102 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1340#(= |#valid| |old(#valid)|)} #114#return; {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,108 INFO L273 TraceCheckUtils]: 17: Hoare triple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0); {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,109 INFO L256 TraceCheckUtils]: 18: Hoare triple {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1340#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 12:59:13,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {1340#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1342#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {1342#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1342#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {1342#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1343#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {1343#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1343#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,121 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1343#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1341#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #114#return; {1344#(and (= 0 (select |old(#valid)| |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {1344#(and (= 0 (select |old(#valid)| |sll_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 |sll_create_#t~ret4.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1345#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:13,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {1345#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1345#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:13,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {1345#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} assume !(~len > 0); {1345#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 12:59:13,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {1345#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1346#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {1346#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {1346#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 12:59:13,135 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1346#(and (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 |sll_create_#res.base|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {1339#(= (select |#valid| |main_~#s~0.base|) 1)} #108#return; {1347#(and (not (= 0 |main_#t~ret10.base|)) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:13,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {1347#(and (not (= 0 |main_#t~ret10.base|)) (not (= |main_~#s~0.base| |main_#t~ret10.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~init~$Pointer$(#t~ret10.base, #t~ret10.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret10.base, #t~ret10.offset; {1348#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-23 12:59:13,138 INFO L256 TraceCheckUtils]: 31: Hoare triple {1348#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} call sll_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && 0 != ~len~0 % 2 then 1 + ~len~0 / 2 else ~len~0 / 2)); {1349#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:13,139 INFO L273 TraceCheckUtils]: 32: Hoare triple {1349#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1350#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)))} is VALID [2018-11-23 12:59:13,140 INFO L256 TraceCheckUtils]: 33: Hoare triple {1350#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1349#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:13,141 INFO L273 TraceCheckUtils]: 34: Hoare triple {1349#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1351#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:13,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {1351#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1351#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-23 12:59:13,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {1351#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1352#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 12:59:13,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {1352#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {1352#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-23 12:59:13,148 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1352#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {1350#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base)))} #116#return; {1353#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))) (= 0 (select |old(#valid)| |sll_insert_#t~ret6.base|)))} is VALID [2018-11-23 12:59:13,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {1353#(and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (or (= 0 (select |old(#valid)| sll_insert_~head.base)) (= (select |#memory_$Pointer$.base| sll_insert_~head.base) (select |old(#memory_$Pointer$.base)| sll_insert_~head.base))) (= 0 (select |old(#valid)| |sll_insert_#t~ret6.base|)))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1354#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base)))} is VALID [2018-11-23 12:59:13,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {1354#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) sll_insert_~last~0.base)))} assume !!(~index > 0);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, 4 + ~last~0.offset, 4);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := #t~post9 - 1;havoc #t~post9; {1355#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 12:59:13,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {1355#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} assume !(~index > 0); {1355#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 12:59:13,171 INFO L273 TraceCheckUtils]: 42: Hoare triple {1355#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (and (not (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base (store (select |#memory_$Pointer$.base| sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base)) |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|))) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, 4 + ~snd_to_last~0.offset, 4); {1356#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 12:59:13,172 INFO L273 TraceCheckUtils]: 43: Hoare triple {1356#(or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (store |#memory_$Pointer$.base| sll_insert_~new_node~0.base (store (select |#memory_$Pointer$.base| sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)) |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4); {1357#(or (= (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 12:59:13,173 INFO L273 TraceCheckUtils]: 44: Hoare triple {1357#(or (= (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} assume true; {1357#(or (= (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} is VALID [2018-11-23 12:59:13,176 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1357#(or (= (select |#memory_$Pointer$.base| |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|)) (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|))} {1348#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} #110#return; {1358#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 12:59:13,177 INFO L273 TraceCheckUtils]: 46: Hoare triple {1358#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;~count~0 := 0; {1359#(not (= 0 main_~ptr~0.base))} is VALID [2018-11-23 12:59:13,178 INFO L273 TraceCheckUtils]: 47: Hoare triple {1359#(not (= 0 main_~ptr~0.base))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {1338#false} is VALID [2018-11-23 12:59:13,178 INFO L273 TraceCheckUtils]: 48: Hoare triple {1338#false} assume ~count~0 != 1 + ~len~0; {1338#false} is VALID [2018-11-23 12:59:13,178 INFO L273 TraceCheckUtils]: 49: Hoare triple {1338#false} assume !false; {1338#false} is VALID [2018-11-23 12:59:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:59:13,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:59:13,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:59:13,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:59:13,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:59:13,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:59:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:59:13,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:59:14,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:14,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:14,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:14,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:15,226 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:15,254 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:15,428 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:15,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:59:15,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 12:59:15,574 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:205, output treesize:375 [2018-11-23 12:59:17,697 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:59:17,697 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|, v_prenex_3, v_prenex_4]. (let ((.cse2 (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) 4 0)) (.cse4 (not (= 0 sll_insert_~new_node~0.base))) (.cse3 (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0)) (.cse5 (<= 0 sll_insert_~new_node~0.offset))) (or (let ((.cse0 (select (select |v_#memory_$Pointer$.base_30| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_30| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 4))) (and (= (store |v_#memory_$Pointer$.offset_30| .cse0 (store (select |v_#memory_$Pointer$.offset_30| .cse0) .cse1 sll_insert_~new_node~0.offset)) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store .cse2 0 (select (select |v_#memory_$Pointer$.offset_30| sll_insert_~new_node~0.base) 0))) |v_#memory_$Pointer$.offset_30|) (= |v_#memory_$Pointer$.base_30| (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store .cse3 0 (select (select |v_#memory_$Pointer$.base_30| sll_insert_~new_node~0.base) 0)))) (not (= .cse0 0)) .cse4 (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_30| .cse0 (store (select |v_#memory_$Pointer$.base_30| .cse0) .cse1 sll_insert_~new_node~0.base))) .cse5)) (let ((.cse8 (select (select v_prenex_4 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (let ((.cse6 (select (select v_prenex_3 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse7 (+ .cse8 4))) (and (= |#memory_$Pointer$.base| (store v_prenex_3 .cse6 (store (select v_prenex_3 .cse6) .cse7 sll_insert_~new_node~0.base))) (not (= .cse8 0)) (= (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store .cse2 0 (select (select v_prenex_4 sll_insert_~new_node~0.base) 0))) v_prenex_4) .cse4 (= v_prenex_3 (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store .cse3 0 (select (select v_prenex_3 sll_insert_~new_node~0.base) 0)))) .cse5 (= |#memory_$Pointer$.offset| (store v_prenex_4 .cse6 (store (select v_prenex_4 .cse6) .cse7 sll_insert_~new_node~0.offset)))))))) [2018-11-23 12:59:17,698 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_DerPreprocessor_2, v_DerPreprocessor_4, v_DerPreprocessor_6, v_DerPreprocessor_8]. (let ((.cse5 (not (= 0 sll_insert_~new_node~0.base))) (.cse6 (<= 0 sll_insert_~new_node~0.offset)) (.cse7 (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0)) (.cse8 (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) 4 0))) (or (let ((.cse4 (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store .cse8 0 v_DerPreprocessor_4)))) (let ((.cse3 (select (select .cse4 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse0 (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store .cse7 0 v_DerPreprocessor_2)))) (let ((.cse1 (select (select .cse0 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse2 (+ .cse3 4))) (and (= |#memory_$Pointer$.base| (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 sll_insert_~new_node~0.base))) (not (= 0 .cse3)) (= |#memory_$Pointer$.offset| (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 sll_insert_~new_node~0.offset))) .cse5 .cse6)))) (let ((.cse9 (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store .cse8 0 v_DerPreprocessor_8))) (.cse12 (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store .cse7 0 v_DerPreprocessor_6)))) (let ((.cse10 (select (select .cse12 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse11 (+ (select (select .cse9 |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 4))) (and (= (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 sll_insert_~new_node~0.offset)) |#memory_$Pointer$.offset|) (not (= .cse10 0)) (= (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 sll_insert_~new_node~0.base)) |#memory_$Pointer$.base|) .cse5 .cse6))))) [2018-11-23 12:59:24,178 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 12:59:26,282 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((sll_insert_~new_node~0.base Int) (sll_insert_~last~0.base Int) (sll_insert_~new_node~0.offset Int) (v_DerPreprocessor_4 Int) (sll_insert_~last~0.offset Int) (v_DerPreprocessor_2 Int)) (let ((.cse7 (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) 4 0) 0 v_DerPreprocessor_4)))) (let ((.cse0 (select (select .cse7 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse3 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0) 0 v_DerPreprocessor_2)))) (let ((.cse2 (+ sll_insert_~new_node~0.offset 4)) (.cse4 (select (select .cse3 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse5 (+ .cse0 4))) (and (not (= 0 .cse0)) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 sll_insert_~new_node~0.base)))) (store .cse1 sll_insert_~new_node~0.base (store (select .cse1 sll_insert_~new_node~0.base) .cse2 sll_insert_~last~0.base)))) (not (= 0 sll_insert_~new_node~0.base)) (= (let ((.cse6 (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 sll_insert_~new_node~0.offset)))) (store .cse6 sll_insert_~new_node~0.base (store (select .cse6 sll_insert_~new_node~0.base) .cse2 sll_insert_~last~0.offset))) |c_#memory_$Pointer$.offset|) (<= 0 sll_insert_~new_node~0.offset)))))) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (v_prenex_9 Int)) (let ((.cse14 (store |c_old(#memory_$Pointer$.base)| v_prenex_9 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_9) 4 0) 0 v_DerPreprocessor_6))) (.cse10 (store |c_old(#memory_$Pointer$.offset)| v_prenex_9 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_9) 4 0) 0 v_DerPreprocessor_8)))) (let ((.cse9 (+ v_prenex_6 4)) (.cse12 (+ (select (select .cse10 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) 4)) (.cse11 (select (select .cse14 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (and (= (let ((.cse8 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_6)))) (store .cse8 v_prenex_9 (store (select .cse8 v_prenex_9) .cse9 v_prenex_7))) |c_#memory_$Pointer$.offset|) (= (let ((.cse13 (store .cse14 .cse11 (store (select .cse14 .cse11) .cse12 v_prenex_9)))) (store .cse13 v_prenex_9 (store (select .cse13 v_prenex_9) .cse9 v_prenex_5))) |c_#memory_$Pointer$.base|) (not (= 0 v_prenex_9)) (<= 0 v_prenex_6) (not (= .cse11 0))))))) is different from true [2018-11-23 13:01:19,249 WARN L180 SmtUtils]: Spent 1.88 m on a formula simplification. DAG size of input: 358 DAG size of output: 189 [2018-11-23 13:01:19,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 241 [2018-11-23 13:01:19,538 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 13:01:19,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:19,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 174 treesize of output 168 [2018-11-23 13:01:19,867 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-11-23 13:01:19,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:19,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 154 [2018-11-23 13:01:19,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:19,892 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:19,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:19,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:20,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 150 [2018-11-23 13:01:20,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-11-23 13:01:20,044 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:20,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 132 [2018-11-23 13:01:20,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:20,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:20,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:20,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 142 [2018-11-23 13:01:20,189 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:20,286 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:20,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:20,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:20,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 188 [2018-11-23 13:01:20,698 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-23 13:01:20,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-23 13:01:20,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-23 13:01:20,724 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:20,736 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:20,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:20,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 163 [2018-11-23 13:01:20,811 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:20,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-11-23 13:01:20,824 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:20,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 121 [2018-11-23 13:01:20,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:20,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:20,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 13:01:20,911 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:20,953 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:21,013 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:21,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:21,118 INFO L478 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 275 treesize of output 237 [2018-11-23 13:01:21,291 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-11-23 13:01:21,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:21,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 185 treesize of output 176 [2018-11-23 13:01:21,613 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-23 13:01:21,617 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:21,618 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:21,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:21,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 169 [2018-11-23 13:01:21,684 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:21,711 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:21,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:21,767 INFO L478 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 0 case distinctions, treesize of input 70 treesize of output 65 [2018-11-23 13:01:21,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 76 [2018-11-23 13:01:21,819 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:21,917 INFO L478 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 55 treesize of output 51 [2018-11-23 13:01:21,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:21,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:21,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 76 [2018-11-23 13:01:21,962 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:22,006 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:22,016 INFO L478 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 47 treesize of output 41 [2018-11-23 13:01:22,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:22,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:22,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:22,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:22,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 97 [2018-11-23 13:01:22,080 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-11-23 13:01:22,182 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:01:22,312 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 13:01:22,473 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 13:01:22,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 200 [2018-11-23 13:01:22,655 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-11-23 13:01:22,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-11-23 13:01:22,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 70 [2018-11-23 13:01:22,733 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:22,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 63 treesize of output 62 [2018-11-23 13:01:22,757 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:22,758 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:22,759 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:22,809 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:22,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:22,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 163 [2018-11-23 13:01:22,915 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:22,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:22,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-11-23 13:01:22,924 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:23,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 121 [2018-11-23 13:01:23,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:23,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:23,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 13:01:23,081 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:23,131 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:23,187 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:23,270 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:23,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 184 [2018-11-23 13:01:23,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 13:01:23,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 13:01:23,345 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:23,357 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:23,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:23,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 166 [2018-11-23 13:01:23,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 168 treesize of output 164 [2018-11-23 13:01:23,640 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:23,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:23,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 145 [2018-11-23 13:01:23,936 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:24,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:24,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:24,345 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-11-23 13:01:24,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 154 [2018-11-23 13:01:24,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:24,512 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 69 [2018-11-23 13:01:24,720 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-23 13:01:24,826 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:25,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:25,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:25,279 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-11-23 13:01:25,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 149 [2018-11-23 13:01:25,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:25,407 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 69 [2018-11-23 13:01:25,439 INFO L267 ElimStorePlain]: Start of recursive call 45: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-23 13:01:25,560 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:25,823 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:25,934 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:25,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 196 [2018-11-23 13:01:26,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 13:01:26,031 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:26,032 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2018-11-23 13:01:26,045 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 21 treesize of output 22 [2018-11-23 13:01:26,051 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,077 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 166 [2018-11-23 13:01:26,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 168 treesize of output 164 [2018-11-23 13:01:26,231 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 145 [2018-11-23 13:01:26,602 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:26,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 138 [2018-11-23 13:01:26,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:26,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,010 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 73 [2018-11-23 13:01:27,023 INFO L267 ElimStorePlain]: Start of recursive call 55: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-23 13:01:27,119 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:27,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 149 [2018-11-23 13:01:27,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,485 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 77 [2018-11-23 13:01:27,499 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-23 13:01:27,597 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:27,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 146 [2018-11-23 13:01:27,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,865 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 77 [2018-11-23 13:01:27,889 INFO L267 ElimStorePlain]: Start of recursive call 59: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-23 13:01:27,973 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:28,057 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:28,167 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:44,985 INFO L478 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 148 treesize of output 129 [2018-11-23 13:01:45,447 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-23 13:01:45,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:45,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 81 [2018-11-23 13:01:45,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2018-11-23 13:01:45,563 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:45,563 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:45,564 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:45,577 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:45,613 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:45,617 INFO L478 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 0 case distinctions, treesize of input 59 treesize of output 48 [2018-11-23 13:01:45,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:45,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 66 [2018-11-23 13:01:45,649 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:45,698 INFO L478 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 53 treesize of output 39 [2018-11-23 13:01:45,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:45,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:45,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:45,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:45,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 67 [2018-11-23 13:01:45,738 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:45,781 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:45,788 INFO L478 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 47 treesize of output 39 [2018-11-23 13:01:45,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:45,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:45,797 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:45,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-11-23 13:01:45,805 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:45,819 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:45,849 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:01:45,902 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:01:45,914 INFO L478 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 151 treesize of output 132 [2018-11-23 13:01:46,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2018-11-23 13:01:46,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,181 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:46,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 84 [2018-11-23 13:01:46,190 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:46,191 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:46,193 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:46,222 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:46,276 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:46,278 INFO L478 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 0 case distinctions, treesize of input 63 treesize of output 52 [2018-11-23 13:01:46,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 81 [2018-11-23 13:01:46,327 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:46,375 INFO L478 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 57 treesize of output 43 [2018-11-23 13:01:46,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,394 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:46,397 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:46,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 96 [2018-11-23 13:01:46,420 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:46,466 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:46,488 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:46,534 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:46,547 INFO L478 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 161 treesize of output 140 [2018-11-23 13:01:46,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2018-11-23 13:01:46,816 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-11-23 13:01:46,823 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:46,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-11-23 13:01:46,826 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:46,852 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:46,893 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:46,896 INFO L478 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 0 case distinctions, treesize of input 59 treesize of output 48 [2018-11-23 13:01:46,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,910 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:46,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-11-23 13:01:46,918 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:46,946 INFO L478 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 42 treesize of output 34 [2018-11-23 13:01:46,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:46,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 13:01:46,985 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:47,065 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:47,089 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:47,138 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:47,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:47,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 146 [2018-11-23 13:01:47,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 13:01:47,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 13:01:47,191 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:47,202 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:47,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:47,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 101 [2018-11-23 13:01:47,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 89 [2018-11-23 13:01:47,316 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:47,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:47,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 105 [2018-11-23 13:01:47,431 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:47,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:47,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 77 [2018-11-23 13:01:47,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:47,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2018-11-23 13:01:47,575 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:47,639 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:47,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:47,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 74 [2018-11-23 13:01:47,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:47,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2018-11-23 13:01:47,871 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:47,911 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:48,011 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:48,082 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:48,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 130 [2018-11-23 13:01:48,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-11-23 13:01:48,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2018-11-23 13:01:48,248 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:48,268 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:48,434 INFO L478 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 91 treesize of output 77 [2018-11-23 13:01:48,444 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:48,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-11-23 13:01:48,453 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:48,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-11-23 13:01:48,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:48,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:48,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 70 [2018-11-23 13:01:48,528 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:48,575 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:48,612 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:48,673 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:48,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 138 [2018-11-23 13:01:48,850 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-11-23 13:01:48,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:48,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-11-23 13:01:48,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2018-11-23 13:01:48,958 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:48,959 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:48,960 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:48,981 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 78 [2018-11-23 13:01:49,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 13:01:49,055 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 63 [2018-11-23 13:01:49,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:49,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:49,150 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:49,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 47 [2018-11-23 13:01:49,160 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,182 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,193 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,227 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 141 [2018-11-23 13:01:49,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 13:01:49,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 13:01:49,286 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,295 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 101 [2018-11-23 13:01:49,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 89 [2018-11-23 13:01:49,432 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:49,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 105 [2018-11-23 13:01:49,733 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 89 [2018-11-23 13:01:49,946 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:49,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-11-23 13:01:49,955 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:49,979 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 74 [2018-11-23 13:01:50,096 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:50,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-11-23 13:01:50,107 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,132 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,179 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,221 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 125 [2018-11-23 13:01:50,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-11-23 13:01:50,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2018-11-23 13:01:50,395 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,409 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,450 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:50,452 INFO L478 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 85 treesize of output 82 [2018-11-23 13:01:50,466 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:50,472 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 73 [2018-11-23 13:01:50,474 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-11-23 13:01:50,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:50,510 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:50,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2018-11-23 13:01:50,517 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,535 INFO L267 ElimStorePlain]: Start of recursive call 125: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,546 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,573 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 143 [2018-11-23 13:01:50,730 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-11-23 13:01:50,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:50,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 73 [2018-11-23 13:01:50,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:50,816 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:50,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2018-11-23 13:01:50,824 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,825 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:50,826 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,847 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 82 [2018-11-23 13:01:50,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 13:01:50,912 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:50,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-11-23 13:01:50,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:50,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:50,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 70 [2018-11-23 13:01:50,981 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:51,018 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:51,045 INFO L267 ElimStorePlain]: Start of recursive call 131: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:51,109 INFO L267 ElimStorePlain]: Start of recursive call 127: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:51,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 144 [2018-11-23 13:01:51,281 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-23 13:01:51,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 85 [2018-11-23 13:01:51,405 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:01:51,406 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:51,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,412 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:51,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 98 [2018-11-23 13:01:51,418 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:51,443 INFO L267 ElimStorePlain]: Start of recursive call 136: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:51,481 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:51,483 INFO L478 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 0 case distinctions, treesize of input 63 treesize of output 52 [2018-11-23 13:01:51,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 93 [2018-11-23 13:01:51,518 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:51,575 INFO L478 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 57 treesize of output 43 [2018-11-23 13:01:51,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 117 [2018-11-23 13:01:51,626 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 4 xjuncts. [2018-11-23 13:01:51,722 INFO L267 ElimStorePlain]: Start of recursive call 141: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:01:51,729 INFO L478 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 51 treesize of output 43 [2018-11-23 13:01:51,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:51,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 58 [2018-11-23 13:01:51,759 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 2 xjuncts. [2018-11-23 13:01:51,796 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:01:51,863 INFO L267 ElimStorePlain]: Start of recursive call 139: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 13:01:51,966 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 13:01:51,980 INFO L478 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 156 treesize of output 135 [2018-11-23 13:01:52,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:52,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-11-23 13:01:52,223 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:52,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 67 [2018-11-23 13:01:52,226 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:52,249 INFO L267 ElimStorePlain]: Start of recursive call 146: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:52,289 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:52,290 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:52,291 INFO L478 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 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-23 13:01:52,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:52,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:52,305 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:52,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-11-23 13:01:52,538 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:52,540 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_52 input size 6 context size 6 output size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:01:52,544 INFO L168 Benchmark]: Toolchain (without parser) took 169805.29 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 977.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.6 MB). Peak memory consumption was 886.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:52,545 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:01:52,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:52,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.45 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:52,546 INFO L168 Benchmark]: Boogie Preprocessor took 48.96 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:01:52,546 INFO L168 Benchmark]: RCFGBuilder took 1100.27 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:52,546 INFO L168 Benchmark]: TraceAbstraction took 167874.85 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 269.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -52.7 MB). Peak memory consumption was 899.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:01:52,549 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 664.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.45 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.96 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1100.27 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167874.85 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 269.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -52.7 MB). Peak memory consumption was 899.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_52 input size 6 context size 6 output size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_52 input size 6 context size 6 output size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...