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/list-ext2-properties/simple_search_value_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:10:17,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:10:17,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:10:17,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:10:17,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:10:17,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:10:17,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:10:17,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:10:17,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:10:17,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:10:17,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:10:17,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:10:17,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:10:17,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:10:17,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:10:17,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:10:17,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:10:17,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:10:17,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:10:17,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:10:17,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:10:17,544 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:10:17,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:10:17,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:10:17,547 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:10:17,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:10:17,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:10:17,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:10:17,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:10:17,558 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:10:17,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:10:17,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:10:17,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:10:17,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:10:17,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:10:17,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:10:17,566 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:10:17,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:10:17,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:10:17,599 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:10:17,600 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:10:17,601 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:10:17,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:10:17,602 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:10:17,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:10:17,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:10:17,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:10:17,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:10:17,604 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:10:17,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:10:17,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:10:17,605 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:10:17,605 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:10:17,605 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:10:17,605 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:10:17,605 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:10:17,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:10:17,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:10:17,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:10:17,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:10:17,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:10:17,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:10:17,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:10:17,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:10:17,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:10:17,609 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:10:17,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:10:17,609 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:10:17,610 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:10:17,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:10:17,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:10:17,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:10:17,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:10:17,685 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:10:17,685 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:10:17,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value_false-unreach-call.i [2018-11-23 11:10:17,758 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef077310d/e9ebca2bc10b4ae88c61be117e4b813b/FLAG5d38a2fb6 [2018-11-23 11:10:18,357 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:10:18,358 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value_false-unreach-call.i [2018-11-23 11:10:18,372 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef077310d/e9ebca2bc10b4ae88c61be117e4b813b/FLAG5d38a2fb6 [2018-11-23 11:10:18,609 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef077310d/e9ebca2bc10b4ae88c61be117e4b813b [2018-11-23 11:10:18,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:10:18,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:10:18,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:18,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:10:18,627 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:10:18,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:18" (1/1) ... [2018-11-23 11:10:18,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f27b578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:18, skipping insertion in model container [2018-11-23 11:10:18,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:18" (1/1) ... [2018-11-23 11:10:18,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:10:18,705 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:10:19,131 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:19,150 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:10:19,217 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:19,375 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:10:19,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19 WrapperNode [2018-11-23 11:10:19,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:19,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:19,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:10:19,377 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:10:19,389 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:10:19" (1/1) ... [2018-11-23 11:10:19,423 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:10:19" (1/1) ... [2018-11-23 11:10:19,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:19,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:10:19,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:10:19,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:10:19,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (1/1) ... [2018-11-23 11:10:19,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (1/1) ... [2018-11-23 11:10:19,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (1/1) ... [2018-11-23 11:10:19,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (1/1) ... [2018-11-23 11:10:19,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (1/1) ... [2018-11-23 11:10:19,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (1/1) ... [2018-11-23 11:10:19,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (1/1) ... [2018-11-23 11:10:19,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:10:19,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:10:19,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:10:19,524 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:10:19,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (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:10:19,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:10:19,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:10:19,589 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:10:19,590 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:10:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:10:19,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:10:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:10:19,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:10:19,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:10:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:10:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:10:19,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:10:19,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:10:20,391 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:10:20,391 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:10:20,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:20 BoogieIcfgContainer [2018-11-23 11:10:20,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:10:20,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:10:20,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:10:20,397 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:10:20,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:10:18" (1/3) ... [2018-11-23 11:10:20,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2473648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:20, skipping insertion in model container [2018-11-23 11:10:20,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:19" (2/3) ... [2018-11-23 11:10:20,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2473648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:20, skipping insertion in model container [2018-11-23 11:10:20,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:20" (3/3) ... [2018-11-23 11:10:20,401 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value_false-unreach-call.i [2018-11-23 11:10:20,412 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:10:20,421 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:10:20,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:10:20,474 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:10:20,474 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:10:20,475 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:10:20,475 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:10:20,475 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:10:20,475 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:10:20,475 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:10:20,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:10:20,476 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:10:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 11:10:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:20,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:20,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:20,503 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:20,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash -258167966, now seen corresponding path program 1 times [2018-11-23 11:10:20,515 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:20,516 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:10:20,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:20,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:20,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 11:10:20,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-23 11:10:20,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 11:10:20,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #78#return; {32#true} is VALID [2018-11-23 11:10:20,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret10 := main(); {32#true} is VALID [2018-11-23 11:10:20,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {32#true} is VALID [2018-11-23 11:10:20,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {32#true} is VALID [2018-11-23 11:10:20,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {32#true} is VALID [2018-11-23 11:10:20,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 11:10:20,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {33#false} is VALID [2018-11-23 11:10:20,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-23 11:10:20,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {33#false} is VALID [2018-11-23 11:10:20,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 11:10:20,688 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:10:20,689 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:20,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:10:20,698 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:20,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:20,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:10:20,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:20,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:10:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:10:20,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:10:20,825 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 11:10:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:21,183 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-23 11:10:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:10:21,183 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2018-11-23 11:10:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2018-11-23 11:10:21,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 55 transitions. [2018-11-23 11:10:21,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:21,535 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:10:21,536 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:10:21,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:10:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:10:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:10:21,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:21,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:10:21,578 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:10:21,578 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:10:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:21,582 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 11:10:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:10:21,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:21,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:21,584 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:10:21,584 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:10:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:21,588 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 11:10:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:10:21,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:21,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:21,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:21,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:10:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 11:10:21,594 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2018-11-23 11:10:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:21,595 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 11:10:21,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:10:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:10:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:21,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:21,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:21,596 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:21,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash -269267516, now seen corresponding path program 1 times [2018-11-23 11:10:21,599 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:21,599 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:10:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:21,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:21,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {192#true} is VALID [2018-11-23 11:10:21,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {192#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {192#true} is VALID [2018-11-23 11:10:21,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {192#true} assume true; {192#true} is VALID [2018-11-23 11:10:21,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {192#true} {192#true} #78#return; {192#true} is VALID [2018-11-23 11:10:21,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {192#true} call #t~ret10 := main(); {192#true} is VALID [2018-11-23 11:10:21,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {212#(not (= (_ bv0 32) main_~a~0.base))} is VALID [2018-11-23 11:10:21,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {212#(not (= (_ bv0 32) main_~a~0.base))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {212#(not (= (_ bv0 32) main_~a~0.base))} is VALID [2018-11-23 11:10:21,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {212#(not (= (_ bv0 32) main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {212#(not (= (_ bv0 32) main_~a~0.base))} is VALID [2018-11-23 11:10:21,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {212#(not (= (_ bv0 32) main_~a~0.base))} assume !(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3; {212#(not (= (_ bv0 32) main_~a~0.base))} is VALID [2018-11-23 11:10:21,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {212#(not (= (_ bv0 32) main_~a~0.base))} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {225#(not (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:10:21,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#(not (= (_ bv0 32) main_~p~0.base))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {193#false} is VALID [2018-11-23 11:10:21,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {193#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {193#false} is VALID [2018-11-23 11:10:21,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {193#false} assume !false; {193#false} is VALID [2018-11-23 11:10:21,977 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:10:21,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:21,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:21,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:10:21,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:10:21,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:21,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:10:22,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:22,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:10:22,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:10:22,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:10:22,019 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2018-11-23 11:10:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:22,785 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:10:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:10:22,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:10:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:10:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 11:10:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:10:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 11:10:22,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-23 11:10:22,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:22,936 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:10:22,936 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:10:22,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:10:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:10:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-11-23 11:10:22,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:22,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:22,960 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:22,960 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:22,962 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 11:10:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 11:10:22,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:22,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:22,964 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 29 states. [2018-11-23 11:10:22,964 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 29 states. [2018-11-23 11:10:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:22,966 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 11:10:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 11:10:22,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:22,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:22,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:22,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:10:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 11:10:22,970 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2018-11-23 11:10:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:22,970 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 11:10:22,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:10:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:10:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:10:22,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:22,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:22,972 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:22,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash -105341628, now seen corresponding path program 1 times [2018-11-23 11:10:22,973 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:22,974 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:22,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:23,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:23,247 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 17 treesize of output 13 [2018-11-23 11:10:23,262 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 5 [2018-11-23 11:10:23,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:23,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:23,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:23,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 11:10:23,281 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:23,281 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (bvadd .cse0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse0 |main_#t~mem8|))) [2018-11-23 11:10:23,281 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem8| (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 11:10:23,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 11:10:23,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {362#true} is VALID [2018-11-23 11:10:23,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 11:10:23,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #78#return; {362#true} is VALID [2018-11-23 11:10:23,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret10 := main(); {362#true} is VALID [2018-11-23 11:10:23,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {362#true} is VALID [2018-11-23 11:10:23,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {362#true} is VALID [2018-11-23 11:10:23,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {362#true} is VALID [2018-11-23 11:10:23,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3; {362#true} is VALID [2018-11-23 11:10:23,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {362#true} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {362#true} is VALID [2018-11-23 11:10:23,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {397#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem7|)} is VALID [2018-11-23 11:10:23,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {397#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem7|)} assume 2bv32 == #t~mem7;havoc #t~mem7;~hasTwo~0 := 1bv32; {401#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:23,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {401#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {405#(= (bvadd |main_#t~mem8| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:23,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#(= (bvadd |main_#t~mem8| (_ bv4294967294 32)) (_ bv0 32))} assume 12bv32 == #t~mem8;havoc #t~mem8;~hasTwelve~0 := 1bv32; {363#false} is VALID [2018-11-23 11:10:23,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {363#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {363#false} is VALID [2018-11-23 11:10:23,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {363#false} is VALID [2018-11-23 11:10:23,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {363#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {363#false} is VALID [2018-11-23 11:10:23,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 11:10:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:23,335 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 (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:10:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:23,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:10:23,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:10:23,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:23,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:10:23,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:23,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:10:23,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:10:23,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:10:23,387 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2018-11-23 11:10:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:24,025 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:10:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:10:24,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 11:10:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:10:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-23 11:10:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:10:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-23 11:10:24,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2018-11-23 11:10:24,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:24,129 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:10:24,129 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:10:24,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:10:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 11:10:24,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:24,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 11:10:24,143 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 11:10:24,143 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 11:10:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:24,145 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 11:10:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:10:24,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:24,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:24,147 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 11:10:24,147 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 11:10:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:24,149 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 11:10:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:10:24,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:24,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:24,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:24,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:10:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 11:10:24,152 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2018-11-23 11:10:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:24,153 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 11:10:24,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:10:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:10:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:10:24,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:24,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:24,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:24,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash -103494586, now seen corresponding path program 1 times [2018-11-23 11:10:24,155 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:24,156 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:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:24,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:24,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-23 11:10:24,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {540#true} is VALID [2018-11-23 11:10:24,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-23 11:10:24,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #78#return; {540#true} is VALID [2018-11-23 11:10:24,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret10 := main(); {540#true} is VALID [2018-11-23 11:10:24,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {540#true} is VALID [2018-11-23 11:10:24,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {540#true} is VALID [2018-11-23 11:10:24,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {566#(= main_~counter~0 (_ bv0 32))} is VALID [2018-11-23 11:10:24,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {566#(= main_~counter~0 (_ bv0 32))} assume !(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3; {541#false} is VALID [2018-11-23 11:10:24,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#false} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {541#false} is VALID [2018-11-23 11:10:24,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {541#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {541#false} is VALID [2018-11-23 11:10:24,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#false} assume 2bv32 == #t~mem7;havoc #t~mem7;~hasTwo~0 := 1bv32; {541#false} is VALID [2018-11-23 11:10:24,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {541#false} call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {541#false} is VALID [2018-11-23 11:10:24,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {541#false} assume !(12bv32 == #t~mem8);havoc #t~mem8; {541#false} is VALID [2018-11-23 11:10:24,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {541#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {541#false} is VALID [2018-11-23 11:10:24,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {541#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {541#false} is VALID [2018-11-23 11:10:24,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {541#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {541#false} is VALID [2018-11-23 11:10:24,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-23 11:10:24,269 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:10:24,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:24,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:24,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:10:24,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:10:24,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:24,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:10:24,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:24,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:10:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:10:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:10:24,390 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2018-11-23 11:10:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:24,686 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 11:10:24,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:10:24,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:10:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:10:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:10:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:10:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:10:24,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 11:10:24,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:24,794 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:10:24,795 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:10:24,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:10:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:10:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 11:10:24,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:24,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 11:10:24,815 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 11:10:24,816 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 11:10:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:24,818 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 11:10:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 11:10:24,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:24,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:24,819 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 11:10:24,819 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 11:10:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:24,822 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 11:10:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 11:10:24,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:24,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:24,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:24,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:10:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 11:10:24,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2018-11-23 11:10:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:24,825 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 11:10:24,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:10:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:10:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:10:24,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:24,827 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] [2018-11-23 11:10:24,827 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:24,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash 411008839, now seen corresponding path program 1 times [2018-11-23 11:10:24,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:24,828 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:10:24,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:24,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:24,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 11:10:24,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {728#true} is VALID [2018-11-23 11:10:24,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:10:24,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #78#return; {728#true} is VALID [2018-11-23 11:10:24,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret10 := main(); {728#true} is VALID [2018-11-23 11:10:24,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {728#true} is VALID [2018-11-23 11:10:24,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {728#true} is VALID [2018-11-23 11:10:24,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {754#(= main_~counter~0 (_ bv0 32))} is VALID [2018-11-23 11:10:24,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {754#(= main_~counter~0 (_ bv0 32))} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {754#(= main_~counter~0 (_ bv0 32))} is VALID [2018-11-23 11:10:24,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {754#(= main_~counter~0 (_ bv0 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {754#(= main_~counter~0 (_ bv0 32))} is VALID [2018-11-23 11:10:24,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {754#(= main_~counter~0 (_ bv0 32))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {764#(= (_ bv1 32) main_~counter~0)} is VALID [2018-11-23 11:10:24,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {764#(= (_ bv1 32) main_~counter~0)} assume !(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3; {729#false} is VALID [2018-11-23 11:10:24,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {729#false} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {729#false} is VALID [2018-11-23 11:10:24,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {729#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {729#false} is VALID [2018-11-23 11:10:24,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {729#false} assume 2bv32 == #t~mem7;havoc #t~mem7;~hasTwo~0 := 1bv32; {729#false} is VALID [2018-11-23 11:10:24,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {729#false} call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {729#false} is VALID [2018-11-23 11:10:24,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {729#false} assume !(12bv32 == #t~mem8);havoc #t~mem8; {729#false} is VALID [2018-11-23 11:10:25,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {729#false} is VALID [2018-11-23 11:10:25,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {729#false} is VALID [2018-11-23 11:10:25,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {729#false} is VALID [2018-11-23 11:10:25,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 11:10:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:25,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:25,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 11:10:25,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {729#false} is VALID [2018-11-23 11:10:25,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {729#false} is VALID [2018-11-23 11:10:25,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {729#false} is VALID [2018-11-23 11:10:25,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {729#false} assume !(12bv32 == #t~mem8);havoc #t~mem8; {729#false} is VALID [2018-11-23 11:10:25,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {729#false} call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {729#false} is VALID [2018-11-23 11:10:25,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {729#false} assume 2bv32 == #t~mem7;havoc #t~mem7;~hasTwo~0 := 1bv32; {729#false} is VALID [2018-11-23 11:10:25,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {729#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {729#false} is VALID [2018-11-23 11:10:25,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {729#false} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {729#false} is VALID [2018-11-23 11:10:25,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {822#(bvslt main_~counter~0 (_ bv10 32))} assume !(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3; {729#false} is VALID [2018-11-23 11:10:25,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {826#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {822#(bvslt main_~counter~0 (_ bv10 32))} is VALID [2018-11-23 11:10:25,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {826#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {826#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:25,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {826#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:25,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {826#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:25,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {728#true} is VALID [2018-11-23 11:10:25,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {728#true} is VALID [2018-11-23 11:10:25,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret10 := main(); {728#true} is VALID [2018-11-23 11:10:25,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #78#return; {728#true} is VALID [2018-11-23 11:10:25,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 11:10:25,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {728#true} is VALID [2018-11-23 11:10:25,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 11:10:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:25,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:25,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:10:25,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:10:25,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:25,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:10:25,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:25,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:10:25,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:10:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:25,155 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-23 11:10:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:25,750 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 11:10:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:25,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:10:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 11:10:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 11:10:25,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2018-11-23 11:10:25,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:25,858 INFO L225 Difference]: With dead ends: 47 [2018-11-23 11:10:25,858 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:10:25,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:10:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:10:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 11:10:25,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:25,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-23 11:10:25,900 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-23 11:10:25,900 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-23 11:10:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:25,902 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:10:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:10:25,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:25,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:25,903 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-23 11:10:25,903 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-23 11:10:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:25,905 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:10:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:10:25,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:25,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:25,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:25,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:10:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 11:10:25,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-11-23 11:10:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:25,908 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 11:10:25,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:10:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:10:25,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:25,909 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:25,910 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:25,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:25,910 INFO L82 PathProgramCache]: Analyzing trace with hash 158018822, now seen corresponding path program 2 times [2018-11-23 11:10:25,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:25,911 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:10:25,931 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:10:26,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:10:26,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:10:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:26,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:26,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {1035#true} call ULTIMATE.init(); {1035#true} is VALID [2018-11-23 11:10:26,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {1035#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1035#true} is VALID [2018-11-23 11:10:26,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {1035#true} assume true; {1035#true} is VALID [2018-11-23 11:10:26,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1035#true} {1035#true} #78#return; {1035#true} is VALID [2018-11-23 11:10:26,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {1035#true} call #t~ret10 := main(); {1035#true} is VALID [2018-11-23 11:10:26,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {1035#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1035#true} is VALID [2018-11-23 11:10:26,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {1035#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1035#true} is VALID [2018-11-23 11:10:26,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {1035#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {1061#(= main_~counter~0 (_ bv0 32))} is VALID [2018-11-23 11:10:26,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#(= main_~counter~0 (_ bv0 32))} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1061#(= main_~counter~0 (_ bv0 32))} is VALID [2018-11-23 11:10:26,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {1061#(= main_~counter~0 (_ bv0 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1061#(= main_~counter~0 (_ bv0 32))} is VALID [2018-11-23 11:10:26,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {1061#(= main_~counter~0 (_ bv0 32))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1071#(= (_ bv1 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {1071#(= (_ bv1 32) main_~counter~0)} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1071#(= (_ bv1 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {1071#(= (_ bv1 32) main_~counter~0)} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1071#(= (_ bv1 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {1071#(= (_ bv1 32) main_~counter~0)} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1081#(= (_ bv2 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {1081#(= (_ bv2 32) main_~counter~0)} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1081#(= (_ bv2 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {1081#(= (_ bv2 32) main_~counter~0)} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1081#(= (_ bv2 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {1081#(= (_ bv2 32) main_~counter~0)} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1091#(= (_ bv3 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {1091#(= (_ bv3 32) main_~counter~0)} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1091#(= (_ bv3 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {1091#(= (_ bv3 32) main_~counter~0)} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1091#(= (_ bv3 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {1091#(= (_ bv3 32) main_~counter~0)} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1101#(= (_ bv4 32) main_~counter~0)} is VALID [2018-11-23 11:10:26,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {1101#(= (_ bv4 32) main_~counter~0)} assume !(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3; {1036#false} is VALID [2018-11-23 11:10:26,257 INFO L273 TraceCheckUtils]: 21: Hoare triple {1036#false} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {1036#false} is VALID [2018-11-23 11:10:26,258 INFO L273 TraceCheckUtils]: 22: Hoare triple {1036#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1036#false} is VALID [2018-11-23 11:10:26,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {1036#false} assume 2bv32 == #t~mem7;havoc #t~mem7;~hasTwo~0 := 1bv32; {1036#false} is VALID [2018-11-23 11:10:26,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {1036#false} call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1036#false} is VALID [2018-11-23 11:10:26,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {1036#false} assume !(12bv32 == #t~mem8);havoc #t~mem8; {1036#false} is VALID [2018-11-23 11:10:26,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {1036#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1036#false} is VALID [2018-11-23 11:10:26,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {1036#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {1036#false} is VALID [2018-11-23 11:10:26,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {1036#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {1036#false} is VALID [2018-11-23 11:10:26,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {1036#false} assume !false; {1036#false} is VALID [2018-11-23 11:10:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:26,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:26,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {1036#false} assume !false; {1036#false} is VALID [2018-11-23 11:10:26,484 INFO L273 TraceCheckUtils]: 28: Hoare triple {1036#false} assume 0bv32 == ~hasTwelve~0 || 0bv32 == ~hasTwo~0; {1036#false} is VALID [2018-11-23 11:10:26,484 INFO L273 TraceCheckUtils]: 27: Hoare triple {1036#false} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {1036#false} is VALID [2018-11-23 11:10:26,484 INFO L273 TraceCheckUtils]: 26: Hoare triple {1036#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1036#false} is VALID [2018-11-23 11:10:26,485 INFO L273 TraceCheckUtils]: 25: Hoare triple {1036#false} assume !(12bv32 == #t~mem8);havoc #t~mem8; {1036#false} is VALID [2018-11-23 11:10:26,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {1036#false} call #t~mem8 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1036#false} is VALID [2018-11-23 11:10:26,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {1036#false} assume 2bv32 == #t~mem7;havoc #t~mem7;~hasTwo~0 := 1bv32; {1036#false} is VALID [2018-11-23 11:10:26,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {1036#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1036#false} is VALID [2018-11-23 11:10:26,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {1036#false} call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~hasTwo~0 := 0bv32;~hasTwelve~0 := 0bv32; {1036#false} is VALID [2018-11-23 11:10:26,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {1159#(bvslt main_~counter~0 (_ bv10 32))} assume !(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3; {1036#false} is VALID [2018-11-23 11:10:26,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {1163#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1159#(bvslt main_~counter~0 (_ bv10 32))} is VALID [2018-11-23 11:10:26,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {1163#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1163#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {1163#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1163#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {1173#(bvslt (bvadd main_~counter~0 (_ bv2 32)) (_ bv10 32))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1163#(bvslt (bvadd main_~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {1173#(bvslt (bvadd main_~counter~0 (_ bv2 32)) (_ bv10 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1173#(bvslt (bvadd main_~counter~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {1173#(bvslt (bvadd main_~counter~0 (_ bv2 32)) (_ bv10 32))} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1173#(bvslt (bvadd main_~counter~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {1183#(bvslt (bvadd main_~counter~0 (_ bv3 32)) (_ bv10 32))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1173#(bvslt (bvadd main_~counter~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {1183#(bvslt (bvadd main_~counter~0 (_ bv3 32)) (_ bv10 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1183#(bvslt (bvadd main_~counter~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {1183#(bvslt (bvadd main_~counter~0 (_ bv3 32)) (_ bv10 32))} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1183#(bvslt (bvadd main_~counter~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {1193#(bvslt (bvadd main_~counter~0 (_ bv4 32)) (_ bv10 32))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;#t~post6 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1183#(bvslt (bvadd main_~counter~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {1193#(bvslt (bvadd main_~counter~0 (_ bv4 32)) (_ bv10 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1193#(bvslt (bvadd main_~counter~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {1193#(bvslt (bvadd main_~counter~0 (_ bv4 32)) (_ bv10 32))} assume !!(~bvslt32(~counter~0, 10bv32) || 0bv32 != #t~nondet3);havoc #t~nondet3;call write~intINTTYPE4(~counter~0, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1193#(bvslt (bvadd main_~counter~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {1035#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~counter~0 := 0bv32; {1193#(bvslt (bvadd main_~counter~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:10:26,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {1035#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1035#true} is VALID [2018-11-23 11:10:26,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {1035#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1035#true} is VALID [2018-11-23 11:10:26,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {1035#true} call #t~ret10 := main(); {1035#true} is VALID [2018-11-23 11:10:26,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1035#true} {1035#true} #78#return; {1035#true} is VALID [2018-11-23 11:10:26,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {1035#true} assume true; {1035#true} is VALID [2018-11-23 11:10:26,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {1035#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1035#true} is VALID [2018-11-23 11:10:26,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {1035#true} call ULTIMATE.init(); {1035#true} is VALID [2018-11-23 11:10:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:10:26,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:26,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:10:26,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 11:10:26,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:26,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:10:26,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:26,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:10:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:10:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:10:26,634 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 12 states. [2018-11-23 11:10:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:28,514 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 11:10:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:10:28,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 11:10:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:10:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2018-11-23 11:10:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:10:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2018-11-23 11:10:28,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2018-11-23 11:10:28,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:28,679 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:10:28,679 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:10:28,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:10:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:10:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-23 11:10:28,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:28,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-23 11:10:28,744 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-23 11:10:28,744 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-23 11:10:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:28,746 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:10:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:10:28,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:28,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:28,747 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-23 11:10:28,747 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-23 11:10:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:28,750 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 11:10:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 11:10:28,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:28,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:28,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:28,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:10:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-11-23 11:10:28,753 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 30 [2018-11-23 11:10:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:28,754 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-11-23 11:10:28,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:10:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-11-23 11:10:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:10:28,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:28,756 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:28,756 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:28,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 393667110, now seen corresponding path program 3 times [2018-11-23 11:10:28,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:28,757 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:28,787 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:10:30,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:10:30,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:10:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:31,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:31,167 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:31,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:31,182 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:31,183 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_22|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_22| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:10:31,183 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:10:31,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:31,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:31,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-23 11:10:31,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,401 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 11 treesize of output 8 [2018-11-23 11:10:31,408 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:10:31,410 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,467 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2018-11-23 11:10:31,480 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:31,480 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|, |v_#valid_23|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_23| main_~t~0.base)) (= main_~a~0.offset main_~p~0.offset) (= (bvadd (select |v_#valid_23| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~counter~0 (_ bv0 32)) (= |#valid| (store |v_#valid_23| main_~t~0.base (_ bv1 1))) (= (store |v_#memory_int_24| main_~p~0.base (store (select |v_#memory_int_24| main_~p~0.base) main_~p~0.offset main_~counter~0)) |#memory_int|)) [2018-11-23 11:10:31,480 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~counter~0 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~p~0.offset) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= main_~t~0.base main_~a~0.base)) (= main_~counter~0 (_ bv0 32))) [2018-11-23 11:10:31,817 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:31,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:31,883 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:10:31,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2018-11-23 11:10:31,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:31,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:31,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:32,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-11-23 11:10:32,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 11:10:32,120 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:10:32,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,179 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:50 [2018-11-23 11:10:32,195 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:32,196 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, |v_#valid_24|]. (and (= (_ bv0 32) (select (select |v_#memory_int_26| main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_24| main_~a~0.base) (_ bv1 1))) (= (_ bv1 1) (select |v_#valid_24| main_~p~0.base)) (= (store |v_#valid_24| main_~t~0.base (_ bv1 1)) |#valid|) (= (store |v_#memory_int_26| main_~p~0.base (store (select |v_#memory_int_26| main_~p~0.base) main_~p~0.offset main_~counter~0)) |#memory_int|) (= (_ bv0 1) (select |v_#valid_24| main_~t~0.base)) (= (_ bv1 32) main_~counter~0)) [2018-11-23 11:10:32,196 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~counter~0) (= (_ bv1 32) main_~counter~0)) [2018-11-23 11:10:32,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-23 11:10:32,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:32,396 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 24 treesize of output 16 [2018-11-23 11:10:32,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,462 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:32,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2018-11-23 11:10:32,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:32,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:32,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:32,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:32,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-23 11:10:32,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:32,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-23 11:10:32,998 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:10:33,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:33,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:33,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:33,145 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:74, output treesize:75 [2018-11-23 11:10:33,185 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:33,185 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, |v_#valid_25|, v_main_~p~0.base_24, v_main_~p~0.offset_24]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_25| main_~t~0.base (_ bv1 1))) (not (= v_main_~p~0.base_24 main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_28| main_~p~0.base (store (select |v_#memory_int_28| main_~p~0.base) main_~p~0.offset main_~counter~0))) (= (select (select |v_#memory_int_28| main_~a~0.base) main_~a~0.offset) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_25| v_main_~p~0.base_24) (_ bv1 1))) (= (select |v_#valid_25| main_~t~0.base) (_ bv0 1)) (= (bvadd (select |v_#valid_25| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (select (select |v_#memory_int_28| v_main_~p~0.base_24) v_main_~p~0.offset_24) (_ bv1 32)) (not (= main_~p~0.base main_~a~0.base)) (= (_ bv1 1) (select |v_#valid_25| main_~p~0.base)) (= (_ bv2 32) main_~counter~0) (not (= v_main_~p~0.base_24 main_~a~0.base))) [2018-11-23 11:10:33,186 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_24, v_main_~p~0.offset_24]. (and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (bvadd (select |#valid| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~counter~0) (not (= main_~p~0.base main_~a~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~t~0.base v_main_~p~0.base_24)) (= (_ bv2 32) main_~counter~0) (not (= v_main_~p~0.base_24 main_~a~0.base))) [2018-11-23 11:10:33,478 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:10:33,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-23 11:10:33,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:33,826 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 24 treesize of output 16 [2018-11-23 11:10:33,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:33,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:33,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:33,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:77 [2018-11-23 11:10:34,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:34,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:34,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:34,189 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:34,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2018-11-23 11:10:34,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-11-23 11:10:34,439 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:10:34,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:34,631 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:99, output treesize:105 [2018-11-23 11:10:34,676 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:34,677 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|, |v_#valid_26|, v_main_~p~0.base_24, v_main_~p~0.offset_24, v_main_~p~0.base_25, v_main_~p~0.offset_25]. (and (= main_~a~0.offset (_ bv0 32)) (= (_ bv3 32) main_~counter~0) (= (select |v_#valid_26| main_~p~0.base) (_ bv1 1)) (= (select (select |v_#memory_int_30| v_main_~p~0.base_24) v_main_~p~0.offset_24) (_ bv1 32)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= (_ bv0 1) (select |v_#valid_26| main_~a~0.base))) (= (_ bv0 1) (select |v_#valid_26| main_~t~0.base)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |v_#memory_int_30| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (select (select |v_#memory_int_30| main_~a~0.base) main_~a~0.offset) (_ bv0 32)) (= |#valid| (store |v_#valid_26| main_~t~0.base (_ bv1 1))) (= (_ bv0 1) (bvadd (select |v_#valid_26| v_main_~p~0.base_25) (_ bv1 1))) (= (store |v_#memory_int_30| main_~p~0.base (store (select |v_#memory_int_30| main_~p~0.base) main_~p~0.offset main_~counter~0)) |#memory_int|) (not (= v_main_~p~0.base_24 main_~a~0.base)) (= (_ bv0 1) (bvadd (select |v_#valid_26| v_main_~p~0.base_24) (_ bv1 1)))) [2018-11-23 11:10:34,677 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_24, v_main_~p~0.base_25, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (and (= main_~a~0.offset (_ bv0 32)) (= (_ bv3 32) main_~counter~0) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (bvadd (select |#valid| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~counter~0) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~t~0.base v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~t~0.base v_main_~p~0.base_24)) (= (bvadd (select |#valid| v_main_~p~0.base_25) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~a~0.base))) [2018-11-23 11:10:34,948 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 11:10:35,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 76 [2018-11-23 11:10:35,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:35,556 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 31 treesize of output 25 [2018-11-23 11:10:35,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:35,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:35,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:35,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:132, output treesize:113 [2018-11-23 11:10:36,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:36,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:36,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:36,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:36,390 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:36,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 105 [2018-11-23 11:10:36,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:36,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 86 [2018-11-23 11:10:36,761 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:10:36,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:36,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:37,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:37,022 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:135, output treesize:145 [2018-11-23 11:10:37,069 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:37,069 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, |v_#valid_27|, v_main_~p~0.base_24, v_main_~p~0.base_25, v_main_~p~0.offset_25, v_main_~p~0.offset_24, v_main_~p~0.base_26, v_main_~p~0.offset_26]. (let ((.cse0 (select (select |v_#memory_int_32| v_main_~p~0.base_26) v_main_~p~0.offset_26))) (and (= (bvadd (select |v_#valid_27| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (= (select (select |v_#memory_int_32| v_main_~p~0.base_25) v_main_~p~0.offset_25) (_ bv2 32)) (= main_~a~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (select (select |v_#memory_int_32| v_main_~p~0.base_24) v_main_~p~0.offset_24) (_ bv1 32)) (= (_ bv0 1) (bvadd (select |v_#valid_27| v_main_~p~0.base_26) (_ bv1 1))) (not (= v_main_~p~0.base_25 main_~a~0.base)) (= |#valid| (store |v_#valid_27| main_~t~0.base (_ bv1 1))) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (= main_~counter~0 (bvadd .cse0 (_ bv1 32))) (= (_ bv1 1) (select |v_#valid_27| main_~p~0.base)) (= (_ bv3 32) .cse0) (= (_ bv0 1) (select |v_#valid_27| main_~t~0.base)) (= (_ bv0 1) (bvadd (select |v_#valid_27| v_main_~p~0.base_25) (_ bv1 1))) (= (store |v_#memory_int_32| main_~p~0.base (store (select |v_#memory_int_32| main_~p~0.base) main_~p~0.offset main_~counter~0)) |#memory_int|) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 main_~a~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= (_ bv0 1) (select |v_#valid_27| main_~a~0.base))) (= (_ bv0 32) (select (select |v_#memory_int_32| main_~a~0.base) main_~a~0.offset)))) [2018-11-23 11:10:37,070 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_26, v_main_~p~0.base_24, v_main_~p~0.base_25, v_main_~p~0.offset_26, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse0 (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26))) (and (not (= main_~t~0.base main_~p~0.base)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~counter~0) (not (= main_~t~0.base v_main_~p~0.base_26)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~t~0.base v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (= .cse0 (_ bv3 32)) (= (bvadd (select |#valid| v_main_~p~0.base_26) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (bvadd (select |#valid| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (= (bvadd .cse0 (_ bv1 32)) main_~counter~0) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~t~0.base v_main_~p~0.base_24)) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (= (bvadd (select |#valid| v_main_~p~0.base_25) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 main_~a~0.base)))) [2018-11-23 11:10:37,269 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-23 11:10:38,018 INFO L303 Elim1Store]: Index analysis took 197 ms [2018-11-23 11:10:38,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 105 [2018-11-23 11:10:38,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:38,055 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 24 treesize of output 16 [2018-11-23 11:10:38,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:38,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:170, output treesize:151 [2018-11-23 11:10:39,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:39,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:39,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:39,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:39,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:39,200 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:39,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 136 [2018-11-23 11:10:39,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,682 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-11-23 11:10:39,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 115 [2018-11-23 11:10:39,728 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:10:39,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:40,125 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:171, output treesize:185 [2018-11-23 11:10:40,352 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:40,353 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, v_main_~p~0.base_27, v_main_~p~0.base_26, v_main_~p~0.offset_26, |v_#valid_28|, v_main_~p~0.base_24, v_main_~p~0.base_25, v_main_~p~0.offset_25, v_main_~p~0.offset_24, v_main_~p~0.offset_27]. (let ((.cse0 (select (select |v_#memory_int_34| v_main_~p~0.base_26) v_main_~p~0.offset_26))) (and (not (= v_main_~p~0.base_27 main_~p~0.base)) (= (bvadd .cse0 (_ bv2 32)) main_~counter~0) (not (= v_main_~p~0.base_26 main_~a~0.base)) (= |#valid| (store |v_#valid_28| main_~t~0.base (_ bv1 1))) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (= |#memory_int| (store |v_#memory_int_34| main_~p~0.base (store (select |v_#memory_int_34| main_~p~0.base) main_~p~0.offset main_~counter~0))) (= (_ bv0 1) (bvadd (select |v_#valid_28| v_main_~p~0.base_26) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |v_#valid_28| v_main_~p~0.base_27) (_ bv1 1))) (= (_ bv2 32) (select (select |v_#memory_int_34| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (select (select |v_#memory_int_34| v_main_~p~0.base_24) v_main_~p~0.offset_24) (_ bv1 32)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (= main_~a~0.offset (_ bv0 32)) (= .cse0 (_ bv3 32)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (bvadd (select |v_#valid_28| v_main_~p~0.base_25) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= (_ bv0 1) (select |v_#valid_28| main_~a~0.base))) (not (= v_main_~p~0.base_27 main_~a~0.base)) (= (bvadd (select |v_#valid_28| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (= (select (select |v_#memory_int_34| v_main_~p~0.base_27) v_main_~p~0.offset_27) (bvadd main_~counter~0 (_ bv4294967295 32))) (= (_ bv0 32) (select (select |v_#memory_int_34| main_~a~0.base) main_~a~0.offset)) (= (_ bv1 1) (select |v_#valid_28| main_~p~0.base)) (= (_ bv0 1) (select |v_#valid_28| main_~t~0.base)) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 main_~a~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)))) [2018-11-23 11:10:40,353 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_26, v_main_~p~0.offset_26, v_main_~p~0.base_27, v_main_~p~0.base_24, v_main_~p~0.base_25, v_main_~p~0.offset_27, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse0 (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse1 (select |#valid| main_~a~0.base))) (and (not (= v_main_~p~0.base_27 main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (= main_~counter~0 (bvadd .cse0 (_ bv2 32))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~counter~0) (not (= main_~t~0.base v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~t~0.base v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (= .cse0 (_ bv3 32)) (= (bvadd (select |#valid| v_main_~p~0.base_26) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= main_~t~0.base v_main_~p~0.base_27)) (= (select (select |#memory_int| v_main_~p~0.base_27) v_main_~p~0.offset_27) (bvadd main_~counter~0 (_ bv4294967295 32))) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (bvadd (select |#valid| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= .cse1 (select |#valid| v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= .cse1 (_ bv0 1))) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~t~0.base v_main_~p~0.base_24)) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (= (bvadd (select |#valid| v_main_~p~0.base_25) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 main_~a~0.base)))) [2018-11-23 11:10:41,030 INFO L303 Elim1Store]: Index analysis took 142 ms [2018-11-23 11:10:41,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 136 [2018-11-23 11:10:41,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:41,088 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 46 treesize of output 42 [2018-11-23 11:10:41,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:41,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:216, output treesize:197 [2018-11-23 11:10:43,524 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:43,524 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, v_main_~p~0.base_26, v_main_~p~0.offset_26, v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_27, v_main_~p~0.base_25, v_main_~p~0.base_24, v_main_~p~0.offset_25, v_main_~p~0.offset_24, v_main_~p~0.offset_27]. (let ((.cse1 (select |v_#memory_int_35| v_main_~p~0.base_28))) (let ((.cse3 (select |#valid| main_~a~0.base)) (.cse0 (select (select |v_#memory_int_35| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse4 (select .cse1 v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_27 main_~p~0.base)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (= (_ bv0 32) (bvadd .cse0 (_ bv4294967293 32))) (= (store |v_#memory_int_35| v_main_~p~0.base_28 (let ((.cse2 (bvadd v_main_~p~0.offset_28 (_ bv4 32)))) (store .cse1 .cse2 (select (select |#memory_int| v_main_~p~0.base_28) .cse2)))) |#memory_int|) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (= (bvadd (select |#valid| v_main_~p~0.base_26) (_ bv1 1)) (_ bv0 1)) (= (select (select |v_#memory_int_35| v_main_~p~0.base_25) v_main_~p~0.offset_25) (_ bv2 32)) (= (select |#valid| v_main_~p~0.base_28) (_ bv1 1)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (= (_ bv1 32) (select (select |v_#memory_int_35| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= (select (select |v_#memory_int_35| main_~a~0.base) main_~a~0.offset) (_ bv0 32)) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (= .cse3 (select |#valid| v_main_~p~0.base_27)) (= (bvadd .cse4 (_ bv1 32)) main_~counter~0) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= .cse3 (_ bv0 1))) (= .cse0 (bvadd .cse4 (_ bv4294967294 32))) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 main_~a~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (= (bvadd (select |#valid| v_main_~p~0.base_25) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select (select |v_#memory_int_35| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse4)))) [2018-11-23 11:10:43,524 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_26, v_main_~p~0.offset_26, v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_27, v_main_~p~0.base_25, v_main_~p~0.base_24, v_main_~p~0.offset_27, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse0 (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse2 (select |#valid| main_~a~0.base)) (.cse1 (select (select |#memory_int| v_main_~p~0.base_28) v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_27 main_~p~0.base)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (= (bvadd (select |#valid| v_main_~p~0.base_26) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| v_main_~p~0.base_28) (_ bv1 1)) (= (_ bv0 32) (bvadd .cse0 (_ bv4294967293 32))) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (= .cse0 (bvadd .cse1 (_ bv4294967294 32))) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (bvadd (select |#valid| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse1) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= .cse2 (select |#valid| v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= .cse2 (_ bv0 1))) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (= main_~counter~0 (bvadd .cse1 (_ bv1 32))) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (= (bvadd (select |#valid| v_main_~p~0.base_25) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 main_~a~0.base)))) [2018-11-23 11:10:44,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:44,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:44,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:44,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:44,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:44,178 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:44,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 113 [2018-11-23 11:10:44,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:44,731 INFO L303 Elim1Store]: Index analysis took 159 ms [2018-11-23 11:10:44,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 156 [2018-11-23 11:10:44,777 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:10:44,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:44,960 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:45,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:45,338 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:213, output treesize:186 [2018-11-23 11:10:47,349 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:47,350 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, v_main_~p~0.base_27, v_main_~p~0.offset_27, v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_26, v_main_~p~0.offset_26, |v_#valid_29|, v_main_~p~0.base_24, v_main_~p~0.base_25, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse1 (select |v_#valid_29| main_~a~0.base)) (.cse2 (select (select |v_#memory_int_36| v_main_~p~0.base_28) v_main_~p~0.offset_28)) (.cse0 (select (select |v_#memory_int_36| v_main_~p~0.base_26) v_main_~p~0.offset_26))) (and (not (= v_main_~p~0.base_27 main_~p~0.base)) (= (_ bv3 32) .cse0) (= (bvadd (select |v_#valid_29| v_main_~p~0.base_24) (_ bv1 1)) (_ bv0 1)) (= (select |v_#valid_29| v_main_~p~0.base_27) .cse1) (= (_ bv1 1) (select |v_#valid_29| main_~p~0.base)) (= (_ bv0 1) (bvadd (select |v_#valid_29| v_main_~p~0.base_25) (_ bv1 1))) (not (= (_ bv0 1) .cse1)) (= (_ bv2 32) (select (select |v_#memory_int_36| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (= .cse2 (bvadd main_~counter~0 (_ bv4294967295 32))) (= (_ bv0 32) (select (select |v_#memory_int_36| main_~a~0.base) main_~a~0.offset)) (= (bvadd (select (select |v_#memory_int_36| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse2) (= .cse2 (bvadd .cse0 (_ bv2 32))) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |v_#valid_29| v_main_~p~0.base_26) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (= (bvadd (select |v_#valid_29| v_main_~p~0.base_28) (_ bv1 1)) (_ bv0 1)) (= (select (select |v_#memory_int_36| v_main_~p~0.base_24) v_main_~p~0.offset_24) (_ bv1 32)) (= (store |v_#memory_int_36| main_~p~0.base (store (select |v_#memory_int_36| main_~p~0.base) main_~p~0.offset main_~counter~0)) |#memory_int|) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 main_~a~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (= (_ bv0 1) (select |v_#valid_29| main_~t~0.base)))) [2018-11-23 11:10:47,350 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_27, v_main_~p~0.offset_27, v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_26, v_main_~p~0.base_25, v_main_~p~0.base_24, v_main_~p~0.offset_26, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse1 (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse0 (select (select |#memory_int| v_main_~p~0.base_28) v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_27 main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= .cse0 (bvadd main_~counter~0 (_ bv4294967295 32))) (not (= v_main_~p~0.base_26 main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~counter~0) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (not (= main_~t~0.base v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~t~0.base v_main_~p~0.base_25)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base)) (= .cse1 (_ bv3 32)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= main_~t~0.base v_main_~p~0.base_27)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse0) (not (= main_~t~0.base v_main_~p~0.base_28)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~t~0.base v_main_~p~0.base_24)) (= (bvadd .cse1 (_ bv2 32)) .cse0) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 main_~a~0.base)))) [2018-11-23 11:10:48,413 INFO L303 Elim1Store]: Index analysis took 216 ms [2018-11-23 11:10:48,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 175 [2018-11-23 11:10:48,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:48,463 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 35 treesize of output 29 [2018-11-23 11:10:48,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:48,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:49,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:49,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:213, output treesize:194 [2018-11-23 11:10:51,187 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:51,187 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_27, v_main_~p~0.offset_27, v_main_~p~0.base_29, v_main_~p~0.base_26, v_main_~p~0.base_25, v_main_~p~0.offset_29, v_main_~p~0.base_24, v_main_~p~0.offset_25, v_main_~p~0.offset_24, v_main_~p~0.offset_26]. (let ((.cse2 (select |v_#memory_int_37| v_main_~p~0.base_29))) (let ((.cse4 (select (select |v_#memory_int_37| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse1 (select (select |v_#memory_int_37| v_main_~p~0.base_28) v_main_~p~0.offset_28)) (.cse0 (select .cse2 v_main_~p~0.offset_29))) (and (not (= v_main_~p~0.base_29 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_27 main_~p~0.base)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_28)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (= (bvadd main_~counter~0 (_ bv4294967295 32)) .cse0) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_24)) (= (select (select |v_#memory_int_37| v_main_~p~0.base_25) v_main_~p~0.offset_25) (_ bv2 32)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (= .cse1 (bvadd (select (select |v_#memory_int_37| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32))) (not (= v_main_~p~0.base_29 main_~a~0.base)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (= (store |v_#memory_int_37| v_main_~p~0.base_29 (let ((.cse3 (bvadd v_main_~p~0.offset_29 (_ bv4 32)))) (store .cse2 .cse3 (select (select |#memory_int| v_main_~p~0.base_29) .cse3)))) |#memory_int|) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= (_ bv1 32) (select (select |v_#memory_int_37| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (= .cse1 (bvadd .cse4 (_ bv2 32))) (= main_~a~0.offset (_ bv0 32)) (= (bvadd .cse4 (_ bv4294967293 32)) (_ bv0 32)) (= (select (select |v_#memory_int_37| main_~a~0.base) main_~a~0.offset) (_ bv0 32)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (= (bvadd .cse1 (_ bv1 32)) .cse0) (not (= v_main_~p~0.base_29 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 main_~a~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26))))) [2018-11-23 11:10:51,187 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_29, v_main_~p~0.offset_29, v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_26, v_main_~p~0.base_27, v_main_~p~0.base_25, v_main_~p~0.base_24, v_main_~p~0.offset_26, v_main_~p~0.offset_27, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse0 (select (select |#memory_int| v_main_~p~0.base_29) v_main_~p~0.offset_29)) (.cse2 (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse1 (select (select |#memory_int| v_main_~p~0.base_28) v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_29 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_27 main_~p~0.base)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_28)) (= .cse0 (bvadd main_~counter~0 (_ bv4294967295 32))) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_24)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (not (= v_main_~p~0.base_29 main_~a~0.base)) (= .cse0 (bvadd .cse1 (_ bv1 32))) (= (_ bv0 32) (bvadd .cse2 (_ bv4294967293 32))) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse1) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_25)) (= (bvadd .cse2 (_ bv2 32)) .cse1) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 main_~a~0.base)))) [2018-11-23 11:10:52,629 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:52,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:53,281 INFO L303 Elim1Store]: Index analysis took 227 ms [2018-11-23 11:10:53,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 197 [2018-11-23 11:10:53,331 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:10:53,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:53,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:53,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:53,983 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:212, output treesize:207 [2018-11-23 11:10:56,034 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:56,034 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, v_main_~p~0.base_29, v_main_~p~0.base_26, v_main_~p~0.base_27, v_main_~p~0.base_28, v_main_~p~0.offset_29, v_main_~p~0.offset_27, v_main_~p~0.offset_28, v_main_~p~0.base_25, v_main_~p~0.offset_26, v_main_~p~0.base_24, v_main_~p~0.offset_25, |v_#valid_30|, v_main_~p~0.offset_24]. (let ((.cse0 (select (select |v_#memory_int_38| v_main_~p~0.base_29) v_main_~p~0.offset_29)) (.cse2 (select (select |v_#memory_int_38| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse1 (select (select |v_#memory_int_38| v_main_~p~0.base_28) v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_29 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_27 main_~p~0.base)) (= (_ bv0 32) (select (select |v_#memory_int_38| main_~a~0.base) main_~a~0.offset)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_28)) (= main_~counter~0 (bvadd .cse0 (_ bv1 32))) (= (store |v_#memory_int_38| main_~p~0.base (store (select |v_#memory_int_38| main_~p~0.base) main_~p~0.offset main_~counter~0)) |#memory_int|) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select (select |v_#memory_int_38| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse1) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (= (_ bv3 32) .cse2) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_24)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= main_~p~0.base main_~a~0.base)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (= (_ bv2 32) (select (select |v_#memory_int_38| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= |#valid| (store |v_#valid_30| main_~t~0.base (_ bv1 1))) (not (= v_main_~p~0.base_28 main_~a~0.base)) (not (= v_main_~p~0.base_29 main_~a~0.base)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= main_~a~0.offset (_ bv0 32)) (= .cse1 (bvadd .cse0 (_ bv4294967295 32))) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (= (select (select |v_#memory_int_38| v_main_~p~0.base_24) v_main_~p~0.offset_24) (_ bv1 32)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (= (bvadd .cse2 (_ bv2 32)) .cse1) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 main_~a~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)))) [2018-11-23 11:10:56,034 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_29, v_main_~p~0.offset_29, v_main_~p~0.base_26, v_main_~p~0.base_27, v_main_~p~0.base_25, v_main_~p~0.base_24, v_main_~p~0.offset_26, v_main_~p~0.offset_27, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse1 (select (select |#memory_int| v_main_~p~0.base_29) v_main_~p~0.offset_29)) (.cse2 (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse0 (select (select |#memory_int| v_main_~p~0.base_28) v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_29 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_27 main_~p~0.base)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_28)) (= .cse0 (bvadd .cse1 (_ bv4294967295 32))) (= main_~t~0.offset (_ bv0 32)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~counter~0) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_24)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base)) (= .cse2 (_ bv3 32)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (= (bvadd .cse1 (_ bv1 32)) main_~counter~0) (not (= v_main_~p~0.base_29 main_~a~0.base)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse0) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_25 main_~p~0.base)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_25)) (= (bvadd .cse2 (_ bv2 32)) .cse0) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 main_~a~0.base)))) [2018-11-23 11:10:58,506 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-23 11:11:00,462 INFO L303 Elim1Store]: Index analysis took 305 ms [2018-11-23 11:11:00,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 216 [2018-11-23 11:11:00,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:00,542 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 35 treesize of output 29 [2018-11-23 11:11:00,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:00,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:01,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 15 variables, input treesize:234, output treesize:215 [2018-11-23 11:11:03,451 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:03,452 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, v_main_~p~0.base_28, v_main_~p~0.offset_28, v_main_~p~0.base_26, v_main_~p~0.offset_26, v_main_~p~0.base_29, v_main_~p~0.base_30, v_main_~p~0.base_25, v_main_~p~0.base_27, v_main_~p~0.offset_25, v_main_~p~0.offset_30, v_main_~p~0.base_24, v_main_~p~0.offset_24, v_main_~p~0.offset_29, v_main_~p~0.offset_27]. (let ((.cse3 (select |v_#memory_int_39| v_main_~p~0.base_30))) (let ((.cse2 (select .cse3 v_main_~p~0.offset_30)) (.cse5 (select (select |v_#memory_int_39| v_main_~p~0.base_29) v_main_~p~0.offset_29)) (.cse1 (select (select |v_#memory_int_39| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse0 (select (select |v_#memory_int_39| v_main_~p~0.base_28) v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_29 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_28)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_27)) (= (select (select |v_#memory_int_39| v_main_~p~0.base_25) v_main_~p~0.offset_25) (_ bv2 32)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (= .cse0 (bvadd .cse1 (_ bv2 32))) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (= (bvadd .cse2 (_ bv1 32)) main_~counter~0) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (= |#memory_int| (store |v_#memory_int_39| v_main_~p~0.base_30 (let ((.cse4 (bvadd v_main_~p~0.offset_30 (_ bv4 32)))) (store .cse3 .cse4 (select (select |#memory_int| v_main_~p~0.base_30) .cse4))))) (not (= v_main_~p~0.base_29 v_main_~p~0.base_24)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_28)) (not (= v_main_~p~0.base_29 main_~a~0.base)) (not (= v_main_~p~0.base_30 main_~a~0.base)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= (_ bv1 32) (select (select |v_#memory_int_39| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (= main_~a~0.offset (_ bv0 32)) (= .cse2 (bvadd .cse5 (_ bv1 32))) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_29)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (= .cse5 (bvadd .cse0 (_ bv1 32))) (not (= v_main_~p~0.base_29 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |v_#memory_int_39| main_~a~0.base) main_~a~0.offset)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_24)) (= (bvadd .cse1 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |v_#memory_int_39| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse0) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 main_~a~0.base)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26))))) [2018-11-23 11:11:03,452 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_30, v_main_~p~0.offset_30, v_main_~p~0.base_29, v_main_~p~0.offset_29, v_main_~p~0.base_26, v_main_~p~0.base_28, v_main_~p~0.base_25, v_main_~p~0.base_27, v_main_~p~0.base_24, v_main_~p~0.offset_28, v_main_~p~0.offset_26, v_main_~p~0.offset_27, v_main_~p~0.offset_25, v_main_~p~0.offset_24]. (let ((.cse0 (select (select |#memory_int| v_main_~p~0.base_30) v_main_~p~0.offset_30)) (.cse1 (select (select |#memory_int| v_main_~p~0.base_29) v_main_~p~0.offset_29)) (.cse3 (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26)) (.cse2 (select (select |#memory_int| v_main_~p~0.base_28) v_main_~p~0.offset_28))) (and (not (= v_main_~p~0.base_29 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_28)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_25)) (= (bvadd .cse0 (_ bv1 32)) main_~counter~0) (= .cse0 (bvadd .cse1 (_ bv1 32))) (not (= v_main_~p~0.base_30 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_26 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_24)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_28 main_~a~0.base)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_28)) (not (= v_main_~p~0.base_29 main_~a~0.base)) (not (= v_main_~p~0.base_30 main_~a~0.base)) (= .cse1 (bvadd .cse2 (_ bv1 32))) (= (_ bv0 32) (bvadd .cse3 (_ bv4294967293 32))) (not (= v_main_~p~0.base_27 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_28)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= v_main_~p~0.base_27 main_~a~0.base)) (not (= v_main_~p~0.base_25 main_~a~0.base)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_27)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_27) v_main_~p~0.offset_27) (_ bv1 32)) .cse2) (not (= v_main_~p~0.base_30 v_main_~p~0.base_29)) (not (= v_main_~p~0.base_28 v_main_~p~0.base_26)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_27)) (not (= v_main_~p~0.base_27 v_main_~p~0.base_25)) (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_30 v_main_~p~0.base_24)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_25) v_main_~p~0.offset_25)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) v_main_~p~0.offset_24)) (not (= v_main_~p~0.base_29 v_main_~p~0.base_25)) (= (bvadd .cse3 (_ bv2 32)) .cse2) (not (= v_main_~p~0.base_26 v_main_~p~0.base_25)) (not (= v_main_~p~0.base_24 v_main_~p~0.base_26)) (not (= v_main_~p~0.base_24 main_~a~0.base)))) [2018-11-23 11:11:06,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:06,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:06,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 11:11:06,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:07,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:07,835 INFO L303 Elim1Store]: Index analysis took 384 ms [2018-11-23 11:11:08,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 30 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 101 treesize of output 327 [2018-11-23 11:11:08,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-23 11:11:08,644 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6561 conjuctions. This might take some time... [2018-11-23 11:11:17,015 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6561 conjuctions.