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_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:09:54,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:09:54,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:09:54,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:09:54,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:09:54,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:09:54,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:09:54,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:09:54,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:09:54,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:09:54,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:09:54,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:09:54,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:09:54,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:09:54,493 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:09:54,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:09:54,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:09:54,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:09:54,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:09:54,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:09:54,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:09:54,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:09:54,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:09:54,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:09:54,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:09:54,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:09:54,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:09:54,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:09:54,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:09:54,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:09:54,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:09:54,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:09:54,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:09:54,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:09:54,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:09:54,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:09:54,537 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:09:54,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:09:54,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:09:54,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:09:54,570 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:09:54,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:09:54,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:09:54,571 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:09:54,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:09:54,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:09:54,572 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:09:54,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:09:54,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:09:54,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:09:54,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:09:54,572 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:09:54,573 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:09:54,573 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:09:54,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:09:54,573 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:09:54,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:09:54,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:09:54,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:09:54,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:09:54,574 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:09:54,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:09:54,576 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:09:54,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:09:54,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:09:54,576 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:09:54,577 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:09:54,577 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:09:54,577 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:09:54,578 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:09:54,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:09:54,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:09:54,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:09:54,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:09:54,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:09:54,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:09:54,744 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9fa38ae/367e1035e40e4e5b85b1e8e0181ff0d8/FLAG3688d736d [2018-11-23 11:09:55,316 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:09:55,317 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:09:55,331 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9fa38ae/367e1035e40e4e5b85b1e8e0181ff0d8/FLAG3688d736d [2018-11-23 11:09:55,594 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9fa38ae/367e1035e40e4e5b85b1e8e0181ff0d8 [2018-11-23 11:09:55,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:09:55,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:09:55,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:55,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:09:55,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:09:55,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:55" (1/1) ... [2018-11-23 11:09:55,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1443edea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:55, skipping insertion in model container [2018-11-23 11:09:55,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:55" (1/1) ... [2018-11-23 11:09:55,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:09:55,693 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:09:56,164 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:56,182 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:09:56,342 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:56,400 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:09:56,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56 WrapperNode [2018-11-23 11:09:56,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:56,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:56,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:09:56,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:09:56,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:56,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:09:56,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:09:56,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:09:56,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:09:56,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:09:56,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:09:56,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:09:56,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (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 11:09:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:09:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:09:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:09:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:09:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:09:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:09:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:09:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:09:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:09:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:09:56,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:09:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:09:57,765 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:09:57,765 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 11:09:57,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:57 BoogieIcfgContainer [2018-11-23 11:09:57,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:09:57,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:09:57,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:09:57,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:09:57,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:09:55" (1/3) ... [2018-11-23 11:09:57,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d8e308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:57, skipping insertion in model container [2018-11-23 11:09:57,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (2/3) ... [2018-11-23 11:09:57,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d8e308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:57, skipping insertion in model container [2018-11-23 11:09:57,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:57" (3/3) ... [2018-11-23 11:09:57,775 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:09:57,785 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:09:57,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 11:09:57,811 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 11:09:57,842 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:09:57,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:09:57,843 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:09:57,843 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:09:57,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:09:57,843 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:09:57,843 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:09:57,843 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:09:57,843 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:09:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 11:09:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:09:57,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:57,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:57,871 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:57,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:57,878 INFO L82 PathProgramCache]: Analyzing trace with hash -51787873, now seen corresponding path program 1 times [2018-11-23 11:09:57,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:57,883 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:09:57,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:57,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:58,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-23 11:09:58,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {43#true} is VALID [2018-11-23 11:09:58,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-23 11:09:58,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #148#return; {43#true} is VALID [2018-11-23 11:09:58,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret19 := main(); {43#true} is VALID [2018-11-23 11:09:58,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {43#true} is VALID [2018-11-23 11:09:58,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-23 11:09:58,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {44#false} is VALID [2018-11-23 11:09:58,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-23 11:09:58,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {44#false} is VALID [2018-11-23 11:09:58,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-23 11:09:58,037 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 11:09:58,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:09:58,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:09:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:09:58,052 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:09:58,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:58,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:09:58,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:58,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:09:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:09:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:09:58,183 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 11:09:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:58,668 INFO L93 Difference]: Finished difference Result 73 states and 113 transitions. [2018-11-23 11:09:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:09:58,668 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:09:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:09:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:09:58,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 113 transitions. [2018-11-23 11:09:59,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:59,591 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:09:59,591 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:09:59,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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 11:09:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:09:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:09:59,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:59,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:59,653 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:59,654 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:59,662 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 11:09:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:09:59,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:59,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:59,664 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:59,664 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:09:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:59,672 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 11:09:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:09:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:59,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:59,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:59,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:09:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 11:09:59,682 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2018-11-23 11:09:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:59,683 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 11:09:59,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:09:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:09:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:09:59,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:59,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:59,685 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:59,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1720743077, now seen corresponding path program 1 times [2018-11-23 11:09:59,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:59,686 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:09:59,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:59,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:59,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2018-11-23 11:09:59,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {273#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {273#true} is VALID [2018-11-23 11:09:59,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2018-11-23 11:09:59,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #148#return; {273#true} is VALID [2018-11-23 11:09:59,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret19 := main(); {273#true} is VALID [2018-11-23 11:09:59,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {273#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {293#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-23 11:09:59,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {293#(not (= (_ bv0 32) main_~head~0.base))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {293#(not (= (_ bv0 32) main_~head~0.base))} is VALID [2018-11-23 11:09:59,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#(not (= (_ bv0 32) main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {300#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:09:59,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {300#(not (= (_ bv0 32) main_~x~0.base))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {300#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:09:59,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {300#(not (= (_ bv0 32) main_~x~0.base))} assume !((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {300#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:09:59,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {300#(not (= (_ bv0 32) main_~x~0.base))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {274#false} is VALID [2018-11-23 11:09:59,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-11-23 11:09:59,900 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 11:09:59,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:09:59,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:09:59,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:09:59,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:09:59,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:59,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:09:59,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:59,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:09:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:09:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:09:59,932 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 11:10:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:00,602 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-23 11:10:00,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:10:00,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 11:10:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:10:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:10:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:10:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:10:00,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 11:10:00,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:00,816 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:10:00,816 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:10:00,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:10:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:10:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 11:10:00,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:00,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 38 states. [2018-11-23 11:10:00,861 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 38 states. [2018-11-23 11:10:00,861 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 38 states. [2018-11-23 11:10:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:00,865 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 11:10:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 11:10:00,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:00,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:00,866 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 44 states. [2018-11-23 11:10:00,867 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 44 states. [2018-11-23 11:10:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:00,870 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 11:10:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 11:10:00,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:00,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:00,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:00,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:10:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 11:10:00,875 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 12 [2018-11-23 11:10:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:00,875 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 11:10:00,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:10:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 11:10:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:10:00,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:00,877 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:00,877 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:00,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash -133294861, now seen corresponding path program 1 times [2018-11-23 11:10:00,878 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:00,878 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:00,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:00,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:01,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 11:10:01,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-11-23 11:10:01,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 11:10:01,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:10:01,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 11:10:01,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:10:01,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,373 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:10:01,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-11-23 11:10:01,406 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,408 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:01,426 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-11-23 11:10:01,434 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:01,435 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_4, v_prenex_1, v_prenex_2, v_prenex_3, |#memory_$Pointer$.base|, v_main_~x~0.base_33, v_main_~x~0.offset_33, |#memory_$Pointer$.offset|]. (or (let ((.cse0 (select (select v_prenex_3 v_prenex_1) v_prenex_2))) (and (= (select (select v_prenex_4 v_prenex_1) v_prenex_2) main_~x~0.base) (not (= (_ bv0 32) .cse0)) (= main_~x~0.offset .cse0))) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~x~0.base_33) v_main_~x~0.offset_33))) (and (= .cse1 main_~x~0.base) (not (= (_ bv0 32) .cse1)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_33) v_main_~x~0.offset_33))))) [2018-11-23 11:10:01,435 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base))) [2018-11-23 11:10:01,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {523#true} is VALID [2018-11-23 11:10:01,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {523#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {523#true} is VALID [2018-11-23 11:10:01,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2018-11-23 11:10:01,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {523#true} {523#true} #148#return; {523#true} is VALID [2018-11-23 11:10:01,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {523#true} call #t~ret19 := main(); {523#true} is VALID [2018-11-23 11:10:01,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {523#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:10:01,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {523#true} is VALID [2018-11-23 11:10:01,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:10:01,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {523#true} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {552#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.offset|))} is VALID [2018-11-23 11:10:01,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {552#(and (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem4.offset|))} assume !!((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:10:01,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:10:01,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} goto; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:10:01,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:10:01,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:10:01,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:10:01,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {524#false} is VALID [2018-11-23 11:10:01,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {524#false} assume !false; {524#false} is VALID [2018-11-23 11:10:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:01,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:01,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {524#false} assume !false; {524#false} is VALID [2018-11-23 11:10:01,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {524#false} is VALID [2018-11-23 11:10:01,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} assume !((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:10:01,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:10:01,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {566#(or (not (= main_~x~0.offset (_ bv0 32))) (not (= (_ bv0 32) main_~x~0.base)))} is VALID [2018-11-23 11:10:01,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} goto; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:10:01,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:10:01,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {600#(or (and (= (_ bv0 32) |main_#t~mem4.offset|) (= |main_#t~mem4.base| (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} assume !!((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {556#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:10:01,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {523#true} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {600#(or (and (= (_ bv0 32) |main_#t~mem4.offset|) (= |main_#t~mem4.base| (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32))))} is VALID [2018-11-23 11:10:01,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:10:01,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {523#true} is VALID [2018-11-23 11:10:01,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {523#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {523#true} is VALID [2018-11-23 11:10:01,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {523#true} call #t~ret19 := main(); {523#true} is VALID [2018-11-23 11:10:01,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {523#true} {523#true} #148#return; {523#true} is VALID [2018-11-23 11:10:01,633 INFO L273 TraceCheckUtils]: 2: Hoare triple {523#true} assume true; {523#true} is VALID [2018-11-23 11:10:01,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {523#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {523#true} is VALID [2018-11-23 11:10:01,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {523#true} is VALID [2018-11-23 11:10:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:01,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:01,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:10:01,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:10:01,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:01,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:10:01,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:01,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:10:01,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:10:01,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:01,813 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 6 states. [2018-11-23 11:10:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:03,527 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:10:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:10:03,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:10:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-11-23 11:10:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-11-23 11:10:03,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2018-11-23 11:10:03,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:03,634 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:10:03,635 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:10:03,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:10:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-23 11:10:03,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:03,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2018-11-23 11:10:03,664 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2018-11-23 11:10:03,665 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2018-11-23 11:10:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:03,668 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:10:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:10:03,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:03,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:03,670 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2018-11-23 11:10:03,670 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2018-11-23 11:10:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:03,672 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 11:10:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 11:10:03,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:03,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:03,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:03,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:10:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-23 11:10:03,676 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2018-11-23 11:10:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:03,676 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 11:10:03,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 11:10:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:10:03,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:03,678 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] [2018-11-23 11:10:03,678 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:03,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2080092492, now seen corresponding path program 1 times [2018-11-23 11:10:03,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:03,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:03,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:03,845 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 6 treesize of output 5 [2018-11-23 11:10:03,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:03,859 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:03,860 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_18|]. (and (= |#valid| (store |v_#valid_18| main_~head~0.base (_ bv1 1))) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:03,860 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| main_~head~0.base) (_ bv1 1)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:04,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:10:04,102 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 10 treesize of output 9 [2018-11-23 11:10:04,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-23 11:10:04,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 4 [2018-11-23 11:10:04,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,467 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 27 treesize of output 22 [2018-11-23 11:10:04,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,492 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 22 treesize of output 18 [2018-11-23 11:10:04,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,633 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-23 11:10:04,652 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 13 treesize of output 16 [2018-11-23 11:10:04,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,665 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 16 treesize of output 23 [2018-11-23 11:10:04,671 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,706 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,746 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:70, output treesize:28 [2018-11-23 11:10:04,801 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:04,802 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, |main_#t~malloc8.base|, main_~x~0.offset, |v_#memory_int_31|, |v_#valid_19|, |v_#memory_int_29|]. (let ((.cse1 (select |v_#memory_int_28| |main_#t~malloc8.base|)) (.cse0 (select |v_#memory_int_31| main_~head~0.base))) (and (= (bvadd (select .cse0 (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_19| main_~head~0.base) (_ bv1 1))) (= (store |v_#memory_int_28| |main_#t~malloc8.base| (store .cse1 (bvadd main_~x~0.offset (_ bv4 32)) (_ bv2 32))) |#memory_int|) (= (store |v_#memory_int_29| |main_#t~malloc8.base| (store (select |v_#memory_int_29| |main_#t~malloc8.base|) main_~x~0.offset (select .cse1 main_~x~0.offset))) |v_#memory_int_28|) (= (store |v_#memory_int_31| main_~head~0.base (store .cse0 main_~head~0.offset (select (select |v_#memory_int_29| main_~head~0.base) main_~head~0.offset))) |v_#memory_int_29|) (= (_ bv0 1) (select |v_#valid_19| |main_#t~malloc8.base|)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:10:04,802 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc8.base|, main_~x~0.offset]. (and (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32))) (not (= |main_#t~malloc8.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv2 32)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:05,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 11:10:05,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 18 treesize of output 7 [2018-11-23 11:10:05,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:05,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-11-23 11:10:05,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-23 11:10:05,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-23 11:10:05,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:10:05,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,475 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-11-23 11:10:05,479 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:05,480 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, |main_#t~malloc8.base|, v_subst_1]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) (and (= main_~t1~0 .cse0) (= (bvadd (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= |main_#t~malloc8.base| main_~x~0.base)) (= (_ bv1 32) .cse0))) [2018-11-23 11:10:05,480 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 32) main_~t1~0) [2018-11-23 11:10:05,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {795#true} is VALID [2018-11-23 11:10:05,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {795#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {795#true} is VALID [2018-11-23 11:10:05,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2018-11-23 11:10:05,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #148#return; {795#true} is VALID [2018-11-23 11:10:05,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret19 := main(); {795#true} is VALID [2018-11-23 11:10:05,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {795#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:05,507 INFO L273 TraceCheckUtils]: 6: Hoare triple {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:05,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:05,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:05,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:05,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:05,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} goto; {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:05,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {822#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {838#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:05,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {838#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume #t~mem7.base == 0bv32 && #t~mem7.offset == 0bv32;havoc #t~mem7.base, #t~mem7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {842#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (not (= |main_#t~malloc8.base| main_~head~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:05,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {842#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (not (= |main_#t~malloc8.base| main_~head~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~head~0.offset))} ~prev~0.base, ~prev~0.offset := 0bv32, 0bv32;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {846#(and (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (not (= |main_#t~malloc8.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:10:05,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {846#(and (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (not (= |main_#t~malloc8.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~next~0.base, ~next~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {850#(and (= (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32)))) (not (= main_~prev~0.base |main_#t~malloc8.base|)))) (= (_ bv0 32) main_~prev~0.offset))} is VALID [2018-11-23 11:10:05,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {850#(and (= (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32)))) (not (= main_~prev~0.base |main_#t~malloc8.base|)))) (= (_ bv0 32) main_~prev~0.offset))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {850#(and (= (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32)))) (not (= main_~prev~0.base |main_#t~malloc8.base|)))) (= (_ bv0 32) main_~prev~0.offset))} is VALID [2018-11-23 11:10:05,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {850#(and (= (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32)))) (not (= main_~prev~0.base |main_#t~malloc8.base|)))) (= (_ bv0 32) main_~prev~0.offset))} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {846#(and (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (not (= |main_#t~malloc8.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:10:05,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {846#(and (exists ((v_subst_1 (_ BitVec 32)) (|main_#t~malloc8.base| (_ BitVec 32))) (and (not (= |main_#t~malloc8.base| main_~x~0.base)) (= (bvadd (select (select |#memory_int| |main_#t~malloc8.base|) (bvadd v_subst_1 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem12 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~t1~0 := #t~mem12;havoc #t~mem12;~t2~0 := 0bv32; {860#(= (_ bv1 32) main_~t1~0)} is VALID [2018-11-23 11:10:05,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {860#(= (_ bv1 32) main_~t1~0)} assume 2bv32 == ~t1~0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~t2~0 := #t~mem14;havoc #t~mem14;havoc #t~mem13.base, #t~mem13.offset; {796#false} is VALID [2018-11-23 11:10:05,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {796#false} assume !(2bv32 != ~t1~0 || 1bv32 == ~t2~0); {796#false} is VALID [2018-11-23 11:10:05,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {796#false} assume !false; {796#false} is VALID [2018-11-23 11:10:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:05,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:08,014 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 11:10:08,020 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 11:10:08,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:08,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:13 [2018-11-23 11:10:08,327 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-23 11:10:08,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:08,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:08,366 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 11:10:08,385 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 11:10:08,470 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 11:10:08,481 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 11:10:08,496 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:08,504 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:08,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 11:10:08,558 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:61, output treesize:48 [2018-11-23 11:10:08,595 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:08,596 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_28|, v_main_~x~0.base_40, v_main_~x~0.offset_40, |v_#memory_int_29|]. (let ((.cse0 (select |v_#memory_int_28| v_main_~x~0.base_40))) (or (not (= (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset (select (select |v_#memory_int_29| main_~x~0.base) main_~x~0.offset))) |v_#memory_int_29|)) (not (= (bvadd (select (select (store |v_#memory_int_28| v_main_~x~0.base_40 (store .cse0 (bvadd v_main_~x~0.offset_40 (_ bv4 32)) (_ bv2 32))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32))) (not (= (store |v_#memory_int_29| v_main_~x~0.base_40 (store (select |v_#memory_int_29| v_main_~x~0.base_40) v_main_~x~0.offset_40 (select .cse0 v_main_~x~0.offset_40))) |v_#memory_int_28|)) (not (= (select |#valid| v_main_~x~0.base_40) (_ bv0 1))))) [2018-11-23 11:10:08,596 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_10, v_main_~x~0.base_40, v_main_~x~0.offset_40, v_DerPreprocessor_8]. (and (or (not (= (select |#valid| v_main_~x~0.base_40) (_ bv0 1))) (not (= (_ bv2 32) (select (select (let ((.cse0 (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_10)))) (store .cse0 v_main_~x~0.base_40 (store (select .cse0 v_main_~x~0.base_40) v_main_~x~0.offset_40 v_DerPreprocessor_8))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))))) (not (= (select |#valid| main_~head~0.base) (_ bv0 1)))) [2018-11-23 11:10:12,740 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-11-23 11:10:12,893 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:10:12,952 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 37 treesize of output 38 [2018-11-23 11:10:13,058 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 14 treesize of output 18 [2018-11-23 11:10:13,070 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:13,075 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 18 treesize of output 24 [2018-11-23 11:10:13,078 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:13,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:13,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2018-11-23 11:10:13,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-11-23 11:10:13,260 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:13,336 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:15,348 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~head~0.offset (_ bv4 32)) (bvadd main_~x~0.offset (_ bv4 32))) [2018-11-23 11:10:15,356 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:15,358 INFO L303 Elim1Store]: Index analysis took 2027 ms [2018-11-23 11:10:15,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-23 11:10:15,376 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 11:10:15,481 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:15,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 11:10:15,489 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:15,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-23 11:10:15,637 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:15,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 11:10:15,645 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:15,733 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:17,748 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~head~0.offset (_ bv4 32)) (bvadd main_~x~0.offset (_ bv4 32))) [2018-11-23 11:10:17,756 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:17,757 INFO L303 Elim1Store]: Index analysis took 2035 ms [2018-11-23 11:10:17,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 11:10:17,777 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 11:10:17,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-11-23 11:10:17,846 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,898 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:17,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-23 11:10:17,972 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:17,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-23 11:10:17,997 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,016 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:10:18,152 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 46 treesize of output 45 [2018-11-23 11:10:18,278 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 28 treesize of output 31 [2018-11-23 11:10:18,286 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:18,292 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 18 treesize of output 24 [2018-11-23 11:10:18,294 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,322 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,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 40 treesize of output 38 [2018-11-23 11:10:18,341 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:18,346 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 34 treesize of output 39 [2018-11-23 11:10:18,349 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,383 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-11-23 11:10:18,499 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:18,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-23 11:10:18,508 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-23 11:10:18,533 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,537 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 11:10:18,645 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:18,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 11:10:18,651 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:18,661 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:20,673 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~head~0.offset (_ bv4 32)) (bvadd main_~x~0.offset (_ bv4 32))) [2018-11-23 11:10:20,682 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:20,683 INFO L303 Elim1Store]: Index analysis took 2028 ms [2018-11-23 11:10:20,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-11-23 11:10:20,702 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-23 11:10:20,784 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:20,875 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:21,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-11-23 11:10:21,168 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 5 variables, input treesize:51, output treesize:112 [2018-11-23 11:10:21,184 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:21,185 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_10, v_main_~x~0.base_40, v_main_~x~0.offset_40, v_DerPreprocessor_8]. (or (not (= (select (select (let ((.cse0 (store |#memory_int| main_~x~0.base (store (store (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv1 32)) main_~x~0.offset v_DerPreprocessor_10)))) (store .cse0 v_main_~x~0.base_40 (store (select .cse0 v_main_~x~0.base_40) v_main_~x~0.offset_40 v_DerPreprocessor_8))) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv2 32))) (not (= (select |#valid| v_main_~x~0.base_40) (_ bv0 1)))) [2018-11-23 11:10:21,185 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~x~0.base_40, v_prenex_7, v_prenex_9, v_prenex_8, v_prenex_10, v_prenex_11]. (let ((.cse3 (bvadd main_~head~0.offset (_ bv4 32)))) (let ((.cse0 (= main_~head~0.base main_~x~0.base)) (.cse1 (= main_~x~0.offset .cse3)) (.cse2 (= .cse3 (bvadd main_~x~0.offset (_ bv4 32))))) (and (or .cse0 (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (or (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) .cse0) (or (= v_main_~x~0.base_40 main_~head~0.base) .cse1 .cse2 (not (= (select |#valid| v_main_~x~0.base_40) (_ bv0 1)))) (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or .cse2 (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (or (= v_prenex_8 main_~head~0.base) .cse2 (not (= (select |#valid| v_prenex_8) (_ bv0 1)))) (or (= v_prenex_10 main_~head~0.base) .cse0 (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (or .cse1 .cse2 (not (= (select |#valid| v_prenex_11) (_ bv0 1))))))) [2018-11-23 11:10:21,587 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2018-11-23 11:10:21,737 INFO L273 TraceCheckUtils]: 21: Hoare triple {796#false} assume !false; {796#false} is VALID [2018-11-23 11:10:21,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {796#false} assume !(2bv32 != ~t1~0 || 1bv32 == ~t2~0); {796#false} is VALID [2018-11-23 11:10:21,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {876#(not (= (_ bv2 32) main_~t1~0))} assume 2bv32 == ~t1~0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~t2~0 := #t~mem14;havoc #t~mem14;havoc #t~mem13.base, #t~mem13.offset; {796#false} is VALID [2018-11-23 11:10:21,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {880#(not (= (_ bv2 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem12 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~t1~0 := #t~mem12;havoc #t~mem12;~t2~0 := 0bv32; {876#(not (= (_ bv2 32) main_~t1~0))} is VALID [2018-11-23 11:10:21,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {884#(not (= (bvadd (select (select |#memory_int| main_~prev~0.base) (bvadd main_~prev~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {880#(not (= (_ bv2 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:10:21,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {884#(not (= (bvadd (select (select |#memory_int| main_~prev~0.base) (bvadd main_~prev~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {884#(not (= (bvadd (select (select |#memory_int| main_~prev~0.base) (bvadd main_~prev~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:21,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {880#(not (= (_ bv2 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~next~0.base, ~next~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {884#(not (= (bvadd (select (select |#memory_int| main_~prev~0.base) (bvadd main_~prev~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:21,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {894#(not (= (_ bv2 32) (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))))} ~prev~0.base, ~prev~0.offset := 0bv32, 0bv32;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {880#(not (= (_ bv2 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:10:23,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {898#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_main_~x~0.offset_40 (_ BitVec 32)) (v_main_~x~0.base_40 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_10)) v_main_~x~0.base_40 (store (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_10)) v_main_~x~0.base_40) v_main_~x~0.offset_40 v_DerPreprocessor_8)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~x~0.base_40) (_ bv0 1)))))} assume #t~mem7.base == 0bv32 && #t~mem7.offset == 0bv32;havoc #t~mem7.base, #t~mem7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {894#(not (= (_ bv2 32) (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))))} is UNKNOWN [2018-11-23 11:10:23,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {898#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_main_~x~0.offset_40 (_ BitVec 32)) (v_main_~x~0.base_40 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_10)) v_main_~x~0.base_40 (store (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_10)) v_main_~x~0.base_40) v_main_~x~0.offset_40 v_DerPreprocessor_8)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~x~0.base_40) (_ bv0 1)))))} is VALID [2018-11-23 11:10:23,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} goto; {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} is VALID [2018-11-23 11:10:23,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} is VALID [2018-11-23 11:10:23,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} assume !((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} is VALID [2018-11-23 11:10:23,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} is VALID [2018-11-23 11:10:23,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {918#(not (= (select |#valid| main_~head~0.base) (_ bv0 1)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {902#(and (not (= (_ bv0 1) (select |#valid| main_~x~0.base))) (or (forall ((v_prenex_7 (_ BitVec 32))) (not (= (select |#valid| v_prenex_7) (_ bv0 1)))) (= main_~head~0.base main_~x~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= main_~head~0.offset main_~x~0.offset)))} is VALID [2018-11-23 11:10:23,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {918#(not (= (select |#valid| main_~head~0.base) (_ bv0 1)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {918#(not (= (select |#valid| main_~head~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:23,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {795#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {918#(not (= (select |#valid| main_~head~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:23,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret19 := main(); {795#true} is VALID [2018-11-23 11:10:23,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #148#return; {795#true} is VALID [2018-11-23 11:10:23,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2018-11-23 11:10:23,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {795#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {795#true} is VALID [2018-11-23 11:10:23,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {795#true} is VALID [2018-11-23 11:10:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:23,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:23,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:10:23,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 11:10:23,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:23,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:10:25,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:25,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:10:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:10:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:10:25,936 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 16 states. [2018-11-23 11:10:26,496 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-23 11:10:45,390 WARN L180 SmtUtils]: Spent 10.15 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-11-23 11:11:11,252 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-23 11:11:22,850 WARN L180 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-11-23 11:11:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:28,690 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2018-11-23 11:11:28,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:11:28,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 11:11:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:11:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 129 transitions. [2018-11-23 11:11:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:11:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 129 transitions. [2018-11-23 11:11:28,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 129 transitions. [2018-11-23 11:11:30,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:30,086 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:11:30,087 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 11:11:30,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:11:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 11:11:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 43. [2018-11-23 11:11:30,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:30,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 43 states. [2018-11-23 11:11:30,166 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 43 states. [2018-11-23 11:11:30,166 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 43 states. [2018-11-23 11:11:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:30,172 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-11-23 11:11:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2018-11-23 11:11:30,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:30,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:30,173 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 95 states. [2018-11-23 11:11:30,174 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 95 states. [2018-11-23 11:11:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:30,178 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-11-23 11:11:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2018-11-23 11:11:30,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:30,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:30,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:30,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:11:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 11:11:30,182 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 22 [2018-11-23 11:11:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:30,182 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 11:11:30,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:11:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 11:11:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:11:30,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:30,184 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] [2018-11-23 11:11:30,184 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:30,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1400034122, now seen corresponding path program 1 times [2018-11-23 11:11:30,185 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:11:30,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:30,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:30,357 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-23 11:11:30,364 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 19 treesize of output 22 [2018-11-23 11:11:30,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:30,380 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 22 treesize of output 14 [2018-11-23 11:11:30,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:30,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:30,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:30,425 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-23 11:11:30,432 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 19 treesize of output 22 [2018-11-23 11:11:30,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:30,553 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 22 treesize of output 14 [2018-11-23 11:11:30,584 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:30,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:30,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:30,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:30,612 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:48, output treesize:18 [2018-11-23 11:11:39,457 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:39,458 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|]. (let ((.cse0 (bvadd main_~head~0.offset (_ bv4 32)))) (and (= (store |v_#memory_$Pointer$.base_30| main_~head~0.base (store (store (select |v_#memory_$Pointer$.base_30| main_~head~0.base) main_~head~0.offset (_ bv0 32)) .cse0 (select (select |#memory_$Pointer$.base| main_~head~0.base) .cse0))) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.offset_30| main_~head~0.base (store (store (select |v_#memory_$Pointer$.offset_30| main_~head~0.base) main_~head~0.offset (_ bv0 32)) .cse0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) .cse0))) |#memory_$Pointer$.offset|) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:39,458 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:11:39,577 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 11:11:39,586 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 18 treesize of output 7 [2018-11-23 11:11:39,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 11:11:39,638 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 18 treesize of output 7 [2018-11-23 11:11:39,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:11:39,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:11:39,670 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,673 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:11:39,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:11:39,690 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,692 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:39,699 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-11-23 11:11:39,772 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:39,772 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~x~0.base, |v_#memory_$Pointer$.base_31|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_31|]. (let ((.cse3 (select |v_#memory_$Pointer$.offset_31| main_~x~0.base)) (.cse2 (select |#memory_$Pointer$.offset| main_~x~0.base)) (.cse1 (select |v_#memory_$Pointer$.base_31| main_~x~0.base)) (.cse0 (select |#memory_$Pointer$.base| main_~x~0.base))) (and (= (select .cse0 (_ bv0 32)) |main_#t~mem7.base|) (= (select .cse1 (_ bv0 32)) (_ bv0 32)) (= |main_#t~mem7.offset| (select .cse2 (_ bv0 32))) (= (select .cse3 (_ bv0 32)) (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_31| main_~x~0.base (store .cse3 (_ bv4 32) (select .cse2 (_ bv4 32)))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_31| main_~x~0.base (store .cse1 (_ bv4 32) (select .cse0 (_ bv4 32))))))) [2018-11-23 11:11:39,772 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem7.offset| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.base|)) [2018-11-23 11:11:39,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {1347#true} call ULTIMATE.init(); {1347#true} is VALID [2018-11-23 11:11:39,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {1347#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1347#true} is VALID [2018-11-23 11:11:39,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {1347#true} assume true; {1347#true} is VALID [2018-11-23 11:11:39,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1347#true} {1347#true} #148#return; {1347#true} is VALID [2018-11-23 11:11:39,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {1347#true} call #t~ret19 := main(); {1347#true} is VALID [2018-11-23 11:11:39,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {1347#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1367#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:39,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {1367#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1367#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:39,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {1367#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:39,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:39,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:39,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:39,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} goto; {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:39,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {1374#(and (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {1390#(and (= |main_#t~mem7.offset| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.base|))} is VALID [2018-11-23 11:11:39,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {1390#(and (= |main_#t~mem7.offset| (_ bv0 32)) (= (_ bv0 32) |main_#t~mem7.base|))} assume !(#t~mem7.base == 0bv32 && #t~mem7.offset == 0bv32);havoc #t~mem7.base, #t~mem7.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset; {1348#false} is VALID [2018-11-23 11:11:39,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {1348#false} ~prev~0.base, ~prev~0.offset := 0bv32, 0bv32;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1348#false} is VALID [2018-11-23 11:11:39,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {1348#false} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~next~0.base, ~next~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1348#false} is VALID [2018-11-23 11:11:39,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {1348#false} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {1348#false} is VALID [2018-11-23 11:11:39,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {1348#false} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1348#false} is VALID [2018-11-23 11:11:39,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#false} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem12 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~t1~0 := #t~mem12;havoc #t~mem12;~t2~0 := 0bv32; {1348#false} is VALID [2018-11-23 11:11:39,812 INFO L273 TraceCheckUtils]: 19: Hoare triple {1348#false} assume 2bv32 == ~t1~0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~t2~0 := #t~mem14;havoc #t~mem14;havoc #t~mem13.base, #t~mem13.offset; {1348#false} is VALID [2018-11-23 11:11:39,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {1348#false} assume !(2bv32 != ~t1~0 || 1bv32 == ~t2~0); {1348#false} is VALID [2018-11-23 11:11:39,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {1348#false} assume !false; {1348#false} is VALID [2018-11-23 11:11:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:11:39,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:11:39,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:11:39,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:11:39,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 11:11:39,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:39,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:11:39,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:39,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:11:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:11:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:11:39,854 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 5 states. [2018-11-23 11:11:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:42,290 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-23 11:11:42,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:11:42,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 11:11:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:11:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 11:11:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:11:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 11:11:42,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2018-11-23 11:11:42,425 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 11:11:42,427 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:11:42,427 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:11:42,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:11:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:11:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2018-11-23 11:11:42,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:42,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 51 states. [2018-11-23 11:11:42,587 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 51 states. [2018-11-23 11:11:42,587 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 51 states. [2018-11-23 11:11:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:42,591 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-11-23 11:11:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-23 11:11:42,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:42,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:42,592 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 63 states. [2018-11-23 11:11:42,592 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 63 states. [2018-11-23 11:11:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:42,594 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-11-23 11:11:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-23 11:11:42,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:42,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:42,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:42,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:11:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2018-11-23 11:11:42,598 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 22 [2018-11-23 11:11:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:42,599 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-23 11:11:42,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:11:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 11:11:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:11:42,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:42,600 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:42,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:42,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1536465972, now seen corresponding path program 2 times [2018-11-23 11:11:42,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:42,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:11:42,623 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:11:42,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:11:42,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:11:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:42,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:42,827 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 6 treesize of output 5 [2018-11-23 11:11:42,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:11:42,841 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:42,841 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_25|]. (and (= |#valid| (store |v_#valid_25| main_~head~0.base (_ bv1 1))) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:11:42,841 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| main_~head~0.base) (_ bv1 1)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:11:42,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:11:42,934 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 10 treesize of output 9 [2018-11-23 11:11:42,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-23 11:11:43,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:43,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:43,230 INFO L303 Elim1Store]: Index analysis took 128 ms [2018-11-23 11:11:43,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 4 [2018-11-23 11:11:43,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:44,144 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-23 11:11:44,145 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 11:11:44,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:11:44,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:44,377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 11:11:44,422 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 19 treesize of output 22 [2018-11-23 11:11:44,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:44,481 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 22 treesize of output 14 [2018-11-23 11:11:44,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:44,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:44,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:44,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:44,868 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 27 treesize of output 22 [2018-11-23 11:11:44,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:44,901 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 22 treesize of output 18 [2018-11-23 11:11:44,904 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:44,924 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:45,033 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:45,080 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:45,178 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-23 11:11:45,187 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 17 treesize of output 20 [2018-11-23 11:11:45,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:45,204 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 20 treesize of output 31 [2018-11-23 11:11:45,207 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:45,225 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:45,252 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:45,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:45,300 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:108, output treesize:47 [2018-11-23 11:11:46,624 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:46,625 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_32|, |main_#t~malloc8.base|, main_~x~0.offset, |v_#memory_int_37|, |v_#memory_int_40|, |v_#valid_26|, |v_#memory_int_38|]. (let ((.cse1 (bvadd main_~x~0.offset (_ bv4 32))) (.cse2 (select |v_#memory_int_40| main_~head~0.base)) (.cse0 (select |v_#memory_int_37| |main_#t~malloc8.base|))) (and (= (store |v_#memory_int_37| |main_#t~malloc8.base| (store .cse0 .cse1 (_ bv2 32))) |#memory_int|) (= (bvadd (select .cse2 (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_26| main_~head~0.base) (_ bv1 1))) (= (select |v_#valid_26| |main_#t~malloc8.base|) (_ bv0 1)) (= (let ((.cse3 (store |v_#memory_$Pointer$.base_32| main_~head~0.base (store (select |v_#memory_$Pointer$.base_32| main_~head~0.base) main_~head~0.offset |main_#t~malloc8.base|)))) (store .cse3 |main_#t~malloc8.base| (store (store (select .cse3 |main_#t~malloc8.base|) main_~x~0.offset (_ bv0 32)) .cse1 (select (select |#memory_$Pointer$.base| |main_#t~malloc8.base|) .cse1)))) |#memory_$Pointer$.base|) (= |v_#memory_int_38| (store |v_#memory_int_40| main_~head~0.base (store .cse2 main_~head~0.offset (select (select |v_#memory_int_38| main_~head~0.base) main_~head~0.offset)))) (= (store |v_#memory_int_38| |main_#t~malloc8.base| (store (select |v_#memory_int_38| |main_#t~malloc8.base|) main_~x~0.offset (select .cse0 main_~x~0.offset))) |v_#memory_int_37|) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:46,625 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~x~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (and (= (select (select |#memory_int| .cse0) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv2 32)) (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) main_~x~0.offset)) (not (= .cse0 main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:46,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-23 11:11:46,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:11:46,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:46,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 16 [2018-11-23 11:11:46,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:46,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:46,975 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 11:11:46,987 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 20 treesize of output 9 [2018-11-23 11:11:46,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:47,028 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:69, output treesize:28 [2018-11-23 11:11:47,047 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:47,047 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_33|, |v_#memory_int_41|, v_subst_2]. (let ((.cse1 (select |v_#memory_int_41| main_~prev~0.base)) (.cse0 (select (select |v_#memory_$Pointer$.base_33| main_~prev~0.base) (_ bv0 32)))) (and (= (select (select |v_#memory_$Pointer$.base_33| .cse0) v_subst_2) (_ bv0 32)) (= (store |v_#memory_int_41| main_~prev~0.base (store .cse1 (_ bv0 32) (select (select |#memory_int| main_~prev~0.base) (_ bv0 32)))) |#memory_int|) (= (bvadd (select .cse1 (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= .cse0 main_~x~0.base) (= (bvadd (select (select |v_#memory_int_41| .cse0) (bvadd v_subst_2 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) main_~prev~0.offset) (not (= main_~prev~0.base .cse0)))) [2018-11-23 11:11:47,047 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2]. (and (= (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~prev~0.base main_~x~0.base)) (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd v_subst_2 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) main_~prev~0.offset)) [2018-11-23 11:11:47,142 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 11 treesize of output 8 [2018-11-23 11:11:47,151 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 8 treesize of output 7 [2018-11-23 11:11:47,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,264 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 11:11:47,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 15 [2018-11-23 11:11:47,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:47,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:47,718 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 11 treesize of output 8 [2018-11-23 11:11:47,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:11:47,752 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,757 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:11:47,814 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:62, output treesize:64 [2018-11-23 11:11:47,892 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:47,892 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_34|, v_main_~prev~0.base_7, |v_#memory_$Pointer$.offset_32|, |v_#memory_int_42|, v_subst_2]. (let ((.cse0 (select |v_#memory_int_42| main_~prev~0.base))) (and (= (store |v_#memory_$Pointer$.offset_32| main_~prev~0.base (store (select |v_#memory_$Pointer$.offset_32| main_~prev~0.base) main_~prev~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 32) (bvadd (select (select |v_#memory_int_42| v_main_~prev~0.base_7) (_ bv4 32)) (_ bv4294967295 32))) (= (_ bv0 32) (bvadd (select .cse0 (bvadd v_subst_2 (_ bv4 32))) (_ bv4294967294 32))) (= (store |v_#memory_int_42| main_~prev~0.base (store .cse0 main_~prev~0.offset (select (select |#memory_int| main_~prev~0.base) main_~prev~0.offset))) |#memory_int|) (not (= main_~prev~0.base v_main_~prev~0.base_7)) (= (store |v_#memory_$Pointer$.base_34| main_~prev~0.base (store (select |v_#memory_$Pointer$.base_34| main_~prev~0.base) main_~prev~0.offset v_main_~prev~0.base_7)) |#memory_$Pointer$.base|))) [2018-11-23 11:11:47,892 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_subst_2]. (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))) (let ((.cse0 (= (_ bv1 32) (select (select |#memory_int| .cse3) (_ bv4 32)))) (.cse1 (= (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset) (_ bv0 32))) (.cse2 (not (= main_~prev~0.base .cse3)))) (or (and (= (_ bv2 32) (select (select |#memory_int| main_~prev~0.base) (bvadd v_subst_2 (_ bv4 32)))) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2)))) [2018-11-23 11:11:48,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-11-23 11:11:48,061 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:11:48,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:11:48,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 11:11:48,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:11:48,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 11:11:48,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-23 11:11:48,121 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,124 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:46, output treesize:5 [2018-11-23 11:11:48,130 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:48,131 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, main_~x~0.base, main_~x~0.offset, |#memory_int|, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (let ((.cse1 (select |#memory_int| .cse0)) (.cse2 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (and (not (= .cse0 main_~x~0.base)) (= (bvadd (select .cse1 (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select .cse1 (bvadd .cse2 (_ bv4 32))) main_~t2~0) (= (_ bv0 32) .cse2)))) [2018-11-23 11:11:48,131 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd main_~t2~0 (_ bv4294967295 32))) [2018-11-23 11:11:48,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {1713#true} call ULTIMATE.init(); {1713#true} is VALID [2018-11-23 11:11:48,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {1713#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1713#true} is VALID [2018-11-23 11:11:48,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {1713#true} assume true; {1713#true} is VALID [2018-11-23 11:11:48,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1713#true} {1713#true} #148#return; {1713#true} is VALID [2018-11-23 11:11:48,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {1713#true} call #t~ret19 := main(); {1713#true} is VALID [2018-11-23 11:11:48,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {1713#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1733#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:48,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {1733#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1733#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:48,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:48,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:48,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !((#t~mem4.base != 0bv32 || #t~mem4.offset != 0bv32) && 0bv32 != #t~nondet5);havoc #t~mem4.base, #t~mem4.offset;havoc #t~nondet5; {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:48,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:48,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} goto; {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:48,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {1740#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {1756#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:48,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {1756#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume #t~mem7.base == 0bv32 && #t~mem7.offset == 0bv32;havoc #t~mem7.base, #t~mem7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(2bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1760#(and (exists ((main_~x~0.offset (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset)))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:48,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {1760#(and (exists ((main_~x~0.offset (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) main_~x~0.offset)))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} ~prev~0.base, ~prev~0.offset := 0bv32, 0bv32;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1764#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) v_subst_2)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd v_subst_2 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:11:48,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {1764#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= main_~x~0.offset (_ bv0 32)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) v_subst_2)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd v_subst_2 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~next~0.base, ~next~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1768#(and (= (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~prev~0.base main_~x~0.base)) (exists ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd v_subst_2 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~prev~0.offset))} is VALID [2018-11-23 11:11:48,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {1768#(and (= (bvadd (select (select |#memory_int| main_~prev~0.base) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~prev~0.base main_~x~0.base)) (exists ((v_subst_2 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd v_subst_2 (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~prev~0.offset))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~next~0.base, ~next~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(~prev~0.base, ~prev~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~prev~0.base, ~prev~0.offset := ~x~0.base, ~x~0.offset;~x~0.base, ~x~0.offset := ~next~0.base, ~next~0.offset; {1772#(and (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset) (_ bv0 32)) (not (= main_~prev~0.base (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))))} is VALID [2018-11-23 11:11:48,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(and (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset) (_ bv0 32)) (not (= main_~prev~0.base (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))))} assume !(~x~0.base != 0bv32 || ~x~0.offset != 0bv32); {1772#(and (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset) (_ bv0 32)) (not (= main_~prev~0.base (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))))} is VALID [2018-11-23 11:11:48,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {1772#(and (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset)) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset) (_ bv0 32)) (not (= main_~prev~0.base (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))))} ~head~0.base, ~head~0.offset := ~prev~0.base, ~prev~0.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1779#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:48,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {1779#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem12 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);~t1~0 := #t~mem12;havoc #t~mem12;~t2~0 := 0bv32; {1779#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:48,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {1779#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume 2bv32 == ~t1~0;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~t2~0 := #t~mem14;havoc #t~mem14;havoc #t~mem13.base, #t~mem13.offset; {1786#(= (_ bv1 32) main_~t2~0)} is VALID [2018-11-23 11:11:48,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {1786#(= (_ bv1 32) main_~t2~0)} assume !(2bv32 != ~t1~0 || 1bv32 == ~t2~0); {1714#false} is VALID [2018-11-23 11:11:48,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {1714#false} assume !false; {1714#false} is VALID [2018-11-23 11:11:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:48,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:11:50,169 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 11:11:50,177 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 11:11:50,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:50,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2018-11-23 11:11:50,361 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:50,361 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_43|, v_main_~prev~0.offset_8]. (or (= (bvadd (select (select |v_#memory_int_43| main_~prev~0.base) (bvadd main_~prev~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (not (= |v_#memory_int_43| (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) v_main_~prev~0.offset_8 (select (select |v_#memory_int_43| main_~x~0.base) v_main_~prev~0.offset_8)))))) [2018-11-23 11:11:50,361 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~prev~0.offset_8, v_DerPreprocessor_16]. (= (bvadd (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) v_main_~prev~0.offset_8 v_DerPreprocessor_16)) main_~prev~0.base) (bvadd main_~prev~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) [2018-11-23 11:11:50,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:50,612 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 11:11:50,617 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 11:11:50,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 11:11:50,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-11-23 11:11:50,676 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:50,677 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_44|, v_main_~prev~0.offset_8, v_DerPreprocessor_16]. (or (= (_ bv0 32) (bvadd (select (select (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (store |v_#memory_int_44| .cse0 (store (select |v_#memory_int_44| .cse0) v_main_~prev~0.offset_8 v_DerPreprocessor_16))) main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv4294967295 32))) (not (= |v_#memory_int_44| (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset (select (select |v_#memory_int_44| main_~x~0.base) main_~x~0.offset)))))) [2018-11-23 11:11:50,677 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_12, v_DerPreprocessor_20]. (let ((.cse0 (select |#memory_int| main_~x~0.base)) (.cse1 (bvadd main_~x~0.offset (_ bv4 32))) (.cse2 (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (and (= (_ bv1 32) (select (store .cse0 main_~x~0.offset v_DerPreprocessor_20) .cse1)) (not .cse2) (or (= (_ bv1 32) (select (store .cse0 main_~x~0.offset v_prenex_12) .cse1)) .cse2))) [2018-11-23 11:11:52,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:52,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:55,480 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 11:11:55,522 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 11:11:56,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:56,869 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,871 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 44 treesize of output 37 [2018-11-23 11:11:57,978 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 9 treesize of output 8 [2018-11-23 11:11:57,979 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 11:11:58,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:11:58,063 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 11:11:58,100 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,132 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:11:58,132 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:11:58,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2018-11-23 11:11:58,135 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,156 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:11:58,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-23 11:11:58,191 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 28 treesize of output 31 [2018-11-23 11:11:58,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-23 11:11:58,269 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 11:11:58,309 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:58,366 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:11:58,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 11:11:58,485 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:11:58,492 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-23 11:11:58,499 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 11:11:58,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-11-23 11:11:58,788 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:58,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:58,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 26 [2018-11-23 11:11:58,857 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:58,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 11:11:58,972 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:59,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 11:11:59,011 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:59,067 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:11:59,128 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:11:59,202 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:12:00,839 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:12:00,927 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:12:01,515 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:12:01,516 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) 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.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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 11:12:01,520 INFO L168 Benchmark]: Toolchain (without parser) took 125913.97 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -847.5 MB). Peak memory consumption was 195.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:01,521 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:12:01,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:01,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.85 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 11:12:01,522 INFO L168 Benchmark]: Boogie Preprocessor took 68.92 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:01,522 INFO L168 Benchmark]: RCFGBuilder took 1250.80 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:01,522 INFO L168 Benchmark]: TraceAbstraction took 123751.86 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 323.0 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -129.4 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:01,524 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.32 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.85 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. * Boogie Preprocessor took 68.92 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1250.80 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123751.86 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 323.0 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -129.4 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...