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/heap-data/calendar_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:19:13,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:19:13,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:19:13,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:19:13,076 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:19:13,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:19:13,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:19:13,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:19:13,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:19:13,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:19:13,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:19:13,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:19:13,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:19:13,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:19:13,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:19:13,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:19:13,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:19:13,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:19:13,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:19:13,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:19:13,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:19:13,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:19:13,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:19:13,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:19:13,100 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:19:13,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:19:13,102 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:19:13,103 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:19:13,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:19:13,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:19:13,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:19:13,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:19:13,106 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:19:13,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:19:13,108 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:19:13,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:19:13,109 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:19:13,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:19:13,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:19:13,138 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:19:13,139 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:19:13,139 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:19:13,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:19:13,143 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:19:13,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:19:13,143 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:19:13,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:19:13,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:19:13,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:19:13,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:19:13,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:19:13,144 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:19:13,145 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:19:13,145 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:19:13,146 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:19:13,146 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:19:13,146 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:19:13,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:19:13,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:19:13,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:19:13,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:19:13,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:19:13,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:19:13,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:19:13,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:19:13,148 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:19:13,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:19:13,148 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:19:13,149 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:19:13,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:19:13,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:19:13,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:19:13,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:19:13,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:19:13,216 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:19:13,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/calendar_true-unreach-call.i [2018-11-23 11:19:13,283 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990386fd7/a1fa412462ec4936a3557fad3d838ffd/FLAG08db61990 [2018-11-23 11:19:13,803 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:19:13,805 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/calendar_true-unreach-call.i [2018-11-23 11:19:13,821 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990386fd7/a1fa412462ec4936a3557fad3d838ffd/FLAG08db61990 [2018-11-23 11:19:14,081 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990386fd7/a1fa412462ec4936a3557fad3d838ffd [2018-11-23 11:19:14,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:19:14,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:19:14,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:14,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:19:14,096 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:19:14,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bbf104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14, skipping insertion in model container [2018-11-23 11:19:14,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:19:14,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:19:14,547 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:14,566 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:19:14,627 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:14,689 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:19:14,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14 WrapperNode [2018-11-23 11:19:14,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:14,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:14,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:19:14,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:19:14,770 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:19:14" (1/1) ... [2018-11-23 11:19:14,792 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:19:14" (1/1) ... [2018-11-23 11:19:14,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:14,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:19:14,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:19:14,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:19:14,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (1/1) ... [2018-11-23 11:19:14,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:19:14,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:19:14,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:19:14,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:19:14,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (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:19:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:19:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:19:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:19:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:19:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:19:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:19:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:19:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:19:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:19:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:19:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:19:15,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:19:15,582 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:19:15,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:15 BoogieIcfgContainer [2018-11-23 11:19:15,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:19:15,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:19:15,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:19:15,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:19:15,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:19:14" (1/3) ... [2018-11-23 11:19:15,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaa967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:15, skipping insertion in model container [2018-11-23 11:19:15,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:14" (2/3) ... [2018-11-23 11:19:15,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaa967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:15, skipping insertion in model container [2018-11-23 11:19:15,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:15" (3/3) ... [2018-11-23 11:19:15,591 INFO L112 eAbstractionObserver]: Analyzing ICFG calendar_true-unreach-call.i [2018-11-23 11:19:15,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:19:15,612 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:19:15,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:19:15,665 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:19:15,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:19:15,666 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:19:15,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:19:15,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:19:15,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:19:15,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:19:15,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:19:15,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:19:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:19:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:19:15,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:15,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:15,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:15,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 203582214, now seen corresponding path program 1 times [2018-11-23 11:19:15,704 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:15,705 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:19:15,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:15,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:16,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:19:16,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-23 11:19:16,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:19:16,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #72#return; {28#true} is VALID [2018-11-23 11:19:16,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret14 := main(); {28#true} is VALID [2018-11-23 11:19:16,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {28#true} is VALID [2018-11-23 11:19:16,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 11:19:16,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {29#false} is VALID [2018-11-23 11:19:16,026 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {29#false} is VALID [2018-11-23 11:19:16,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {29#false} is VALID [2018-11-23 11:19:16,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} #t~short12 := #t~short8; {29#false} is VALID [2018-11-23 11:19:16,027 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume #t~short12; {29#false} is VALID [2018-11-23 11:19:16,028 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {29#false} is VALID [2018-11-23 11:19:16,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:19:16,032 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:19:16,032 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:16,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:16,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:19:16,042 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:19:16,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:16,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:19:16,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:16,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:19:16,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:19:16,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:19:16,148 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 11:19:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:16,266 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2018-11-23 11:19:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:19:16,266 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:19:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 11:19:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:19:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 11:19:16,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 11:19:16,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:16,554 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:19:16,555 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:19:16,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:19:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:19:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:19:16,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:16,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:16,677 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:16,677 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:16,682 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-11-23 11:19:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-11-23 11:19:16,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:16,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:16,686 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:16,686 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:16,693 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-11-23 11:19:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-11-23 11:19:16,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:16,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:16,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:16,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:19:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-23 11:19:16,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2018-11-23 11:19:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:16,703 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 11:19:16,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:19:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-11-23 11:19:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:19:16,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:16,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:16,705 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:16,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1075592643, now seen corresponding path program 1 times [2018-11-23 11:19:16,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:16,707 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:19:16,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:16,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:17,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 11:19:17,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {189#true} is VALID [2018-11-23 11:19:17,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 11:19:17,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #72#return; {189#true} is VALID [2018-11-23 11:19:17,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret14 := main(); {189#true} is VALID [2018-11-23 11:19:17,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {209#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:17,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {209#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:17,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {209#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:17,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {209#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {219#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:17,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {219#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {190#false} is VALID [2018-11-23 11:19:17,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {190#false} is VALID [2018-11-23 11:19:17,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} #t~short12 := #t~short8; {190#false} is VALID [2018-11-23 11:19:17,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {190#false} assume #t~short12; {190#false} is VALID [2018-11-23 11:19:17,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {190#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {190#false} is VALID [2018-11-23 11:19:17,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 11:19:17,025 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:19:17,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:17,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:17,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:19:17,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:19:17,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:17,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:19:17,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:17,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:19:17,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:19:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:19:17,123 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2018-11-23 11:19:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:18,354 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2018-11-23 11:19:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:19:18,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:19:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 11:19:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-23 11:19:18,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2018-11-23 11:19:18,486 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:19:18,488 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:19:18,489 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:19:18,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:19:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:19:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:19:18,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:18,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:19:18,500 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:19:18,500 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:19:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:18,503 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-11-23 11:19:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-11-23 11:19:18,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:18,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:18,504 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:19:18,504 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:19:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:18,507 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-11-23 11:19:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-11-23 11:19:18,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:18,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:18,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:18,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:19:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 11:19:18,510 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15 [2018-11-23 11:19:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:18,511 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 11:19:18,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:19:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-11-23 11:19:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:19:18,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:18,512 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:18,513 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:18,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1640511175, now seen corresponding path program 1 times [2018-11-23 11:19:18,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:18,514 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:19:18,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:18,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:18,733 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 33 treesize of output 30 [2018-11-23 11:19:18,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:18,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:18,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:18,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:18,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:18,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:18,815 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 27 treesize of output 39 [2018-11-23 11:19:18,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:19,044 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 33 treesize of output 30 [2018-11-23 11:19:19,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:19,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:19,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:19,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:19,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:19,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:19,130 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 27 treesize of output 39 [2018-11-23 11:19:19,134 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:19,182 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:19,204 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:19,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:19,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:19,303 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:67, output treesize:31 [2018-11-23 11:19:19,360 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:19,361 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, main_~ev1~0, main_~ev2~0, v_prenex_1, v_prenex_2, v_prenex_3]. (let ((.cse0 (= (_ bv0 32) main_~l~0.offset)) (.cse1 (bvadd main_~l~0.offset (_ bv4 32))) (.cse2 (bvadd main_~l~0.offset (_ bv8 32))) (.cse3 (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) (or (and .cse0 (not (= main_~ev1~0 (_ bv1 32))) (= (store |v_#memory_int_11| main_~l~0.base (store (store (store (select |v_#memory_int_11| main_~l~0.base) .cse1 main_~ev1~0) .cse2 main_~ev2~0) main_~l~0.offset .cse3)) |#memory_int|)) (and .cse0 (= (store v_prenex_1 main_~l~0.base (store (store (store (select v_prenex_1 main_~l~0.base) .cse1 v_prenex_2) .cse2 v_prenex_3) main_~l~0.offset .cse3)) |#memory_int|) (not (= v_prenex_3 (_ bv3 32)))))) [2018-11-23 11:19:19,361 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= (_ bv0 32) main_~l~0.offset)) (.cse1 (select |#memory_int| main_~l~0.base))) (or (and .cse0 (not (= (bvadd (select .cse1 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (and .cse0 (not (= (_ bv1 32) (select .cse1 (bvadd main_~l~0.offset (_ bv4 32)))))))) [2018-11-23 11:19:19,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2018-11-23 11:19:19,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {371#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {371#true} is VALID [2018-11-23 11:19:19,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2018-11-23 11:19:19,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2018-11-23 11:19:19,913 INFO L256 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret14 := main(); {371#true} is VALID [2018-11-23 11:19:19,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {371#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {371#true} is VALID [2018-11-23 11:19:19,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {371#true} goto; {371#true} is VALID [2018-11-23 11:19:19,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {371#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {371#true} is VALID [2018-11-23 11:19:19,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {371#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {371#true} is VALID [2018-11-23 11:19:19,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {403#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:19,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {403#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} goto; {403#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:19,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {403#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {403#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:19,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {403#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {413#(or (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:19,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {413#(or (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {417#(and (or (and |main_#t~short8| (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (and (not |main_#t~short8|) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))))) (or (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))))} is VALID [2018-11-23 11:19:19,993 INFO L273 TraceCheckUtils]: 14: Hoare triple {417#(and (or (and |main_#t~short8| (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (and (not |main_#t~short8|) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))))) (or (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {421#(not |main_#t~short8|)} is VALID [2018-11-23 11:19:20,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {421#(not |main_#t~short8|)} #t~short12 := #t~short8; {425#(not |main_#t~short12|)} is VALID [2018-11-23 11:19:20,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {425#(not |main_#t~short12|)} assume #t~short12; {372#false} is VALID [2018-11-23 11:19:20,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {372#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {372#false} is VALID [2018-11-23 11:19:20,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {372#false} assume !false; {372#false} is VALID [2018-11-23 11:19:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:20,018 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:19:20,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:20,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:19:20,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:19:20,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:20,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:19:20,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:20,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:19:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:19:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:19:20,068 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 7 states. [2018-11-23 11:19:20,887 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:19:22,399 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-23 11:19:22,699 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2018-11-23 11:19:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:23,390 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2018-11-23 11:19:23,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:19:23,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 11:19:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:19:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-23 11:19:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:19:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2018-11-23 11:19:23,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2018-11-23 11:19:23,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:23,841 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:19:23,841 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:19:23,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:19:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:19:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2018-11-23 11:19:23,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:23,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 29 states. [2018-11-23 11:19:23,871 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 29 states. [2018-11-23 11:19:23,872 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 29 states. [2018-11-23 11:19:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:23,875 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2018-11-23 11:19:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2018-11-23 11:19:23,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:23,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:23,877 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 45 states. [2018-11-23 11:19:23,877 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 45 states. [2018-11-23 11:19:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:23,881 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2018-11-23 11:19:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2018-11-23 11:19:23,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:23,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:23,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:23,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:19:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-23 11:19:23,884 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 19 [2018-11-23 11:19:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:23,885 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-23 11:19:23,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:19:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-11-23 11:19:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:19:23,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:23,886 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:23,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:23,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash -276635713, now seen corresponding path program 1 times [2018-11-23 11:19:23,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:23,888 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:19:23,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:23,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:24,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {647#true} is VALID [2018-11-23 11:19:24,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {647#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {647#true} is VALID [2018-11-23 11:19:24,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2018-11-23 11:19:24,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #72#return; {647#true} is VALID [2018-11-23 11:19:24,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret14 := main(); {647#true} is VALID [2018-11-23 11:19:24,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {647#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {647#true} is VALID [2018-11-23 11:19:24,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {647#true} goto; {647#true} is VALID [2018-11-23 11:19:24,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {647#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {647#true} is VALID [2018-11-23 11:19:24,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {647#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {647#true} is VALID [2018-11-23 11:19:24,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {647#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {647#true} is VALID [2018-11-23 11:19:24,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {647#true} goto; {647#true} is VALID [2018-11-23 11:19:24,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {647#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {647#true} is VALID [2018-11-23 11:19:24,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {647#true} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {647#true} is VALID [2018-11-23 11:19:24,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {647#true} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {691#(or (and |main_#t~short8| (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (and (not |main_#t~short8|) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:19:24,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {691#(or (and |main_#t~short8| (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (and (not |main_#t~short8|) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {695#(= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:24,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {695#(= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} #t~short12 := #t~short8; {695#(= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:24,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {695#(= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {702#(not |main_#t~short11|)} is VALID [2018-11-23 11:19:24,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {702#(not |main_#t~short11|)} assume #t~short11;call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short11 := 2bv32 == #t~mem10; {648#false} is VALID [2018-11-23 11:19:24,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {648#false} #t~short12 := #t~short11; {648#false} is VALID [2018-11-23 11:19:24,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {648#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {648#false} is VALID [2018-11-23 11:19:24,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {648#false} assume !false; {648#false} is VALID [2018-11-23 11:19:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:19:24,102 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:24,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:24,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:19:24,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 11:19:24,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:24,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:19:24,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:24,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:19:24,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:19:24,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:19:24,155 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 5 states. [2018-11-23 11:19:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:24,963 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-23 11:19:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:19:24,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 11:19:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:19:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 11:19:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:19:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 11:19:24,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-23 11:19:25,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:25,144 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:19:25,144 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:19:25,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:19:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:19:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-11-23 11:19:25,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:25,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 32 states. [2018-11-23 11:19:25,202 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 32 states. [2018-11-23 11:19:25,202 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 32 states. [2018-11-23 11:19:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:25,204 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 11:19:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2018-11-23 11:19:25,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:25,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:25,205 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 40 states. [2018-11-23 11:19:25,205 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 40 states. [2018-11-23 11:19:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:25,208 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 11:19:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2018-11-23 11:19:25,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:25,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:25,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:25,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:19:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-11-23 11:19:25,211 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 21 [2018-11-23 11:19:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:25,211 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-23 11:19:25,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:19:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-11-23 11:19:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:19:25,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:25,212 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:25,213 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:25,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash -276576131, now seen corresponding path program 1 times [2018-11-23 11:19:25,213 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:25,213 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:19:25,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:25,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:25,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {903#true} call ULTIMATE.init(); {903#true} is VALID [2018-11-23 11:19:25,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {903#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {903#true} is VALID [2018-11-23 11:19:25,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {903#true} assume true; {903#true} is VALID [2018-11-23 11:19:25,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {903#true} {903#true} #72#return; {903#true} is VALID [2018-11-23 11:19:25,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {903#true} call #t~ret14 := main(); {903#true} is VALID [2018-11-23 11:19:25,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {903#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {903#true} is VALID [2018-11-23 11:19:25,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {903#true} goto; {903#true} is VALID [2018-11-23 11:19:25,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {903#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {903#true} is VALID [2018-11-23 11:19:25,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {903#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {903#true} is VALID [2018-11-23 11:19:25,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {903#true} is VALID [2018-11-23 11:19:25,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#true} goto; {903#true} is VALID [2018-11-23 11:19:25,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {903#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {903#true} is VALID [2018-11-23 11:19:25,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {903#true} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {903#true} is VALID [2018-11-23 11:19:25,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {903#true} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {903#true} is VALID [2018-11-23 11:19:25,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {903#true} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {903#true} is VALID [2018-11-23 11:19:25,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {903#true} #t~short12 := #t~short8; {903#true} is VALID [2018-11-23 11:19:25,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {903#true} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {903#true} is VALID [2018-11-23 11:19:25,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {903#true} assume !#t~short11; {959#(not |main_#t~short11|)} is VALID [2018-11-23 11:19:25,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {959#(not |main_#t~short11|)} #t~short12 := #t~short11; {963#(not |main_#t~short12|)} is VALID [2018-11-23 11:19:25,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {963#(not |main_#t~short12|)} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {904#false} is VALID [2018-11-23 11:19:25,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {904#false} assume !false; {904#false} is VALID [2018-11-23 11:19:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:19:25,326 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:25,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:25,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:19:25,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 11:19:25,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:25,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:19:25,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:25,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:19:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:19:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:19:25,356 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 4 states. [2018-11-23 11:19:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:25,659 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-23 11:19:25,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:19:25,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 11:19:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 11:19:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 11:19:25,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2018-11-23 11:19:25,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:25,736 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:19:25,737 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:19:25,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:19:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:19:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:19:25,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:25,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 11:19:25,785 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:19:25,785 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:19:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:25,787 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-23 11:19:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 11:19:25,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:25,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:25,788 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:19:25,788 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:19:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:25,790 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-23 11:19:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 11:19:25,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:25,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:25,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:25,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:19:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-23 11:19:25,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 21 [2018-11-23 11:19:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:25,794 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-23 11:19:25,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:19:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 11:19:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:19:25,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:25,796 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:25,796 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:25,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1498371649, now seen corresponding path program 1 times [2018-11-23 11:19:25,797 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:25,797 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:19:25,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:25,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:25,975 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 33 treesize of output 30 [2018-11-23 11:19:25,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:25,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:26,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-11-23 11:19:26,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,172 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 33 treesize of output 30 [2018-11-23 11:19:26,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:26,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:26,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:26,237 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 27 treesize of output 39 [2018-11-23 11:19:26,239 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,264 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:26,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:26,331 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:67, output treesize:31 [2018-11-23 11:19:26,460 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:26,461 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~ev1~0, main_~ev2~0, v_prenex_5, v_prenex_4, v_prenex_6]. (let ((.cse1 (bvadd main_~l~0.offset (_ bv4 32))) (.cse2 (bvadd main_~l~0.offset (_ bv8 32))) (.cse3 (select (select |#memory_int| main_~l~0.base) main_~l~0.offset)) (.cse0 (= (_ bv0 32) main_~l~0.offset))) (or (and (not (= main_~ev1~0 (_ bv0 32))) .cse0 (= (store |v_#memory_int_12| main_~l~0.base (store (store (store (select |v_#memory_int_12| main_~l~0.base) .cse1 main_~ev1~0) .cse2 main_~ev2~0) main_~l~0.offset .cse3)) |#memory_int|)) (and (= (store v_prenex_5 main_~l~0.base (store (store (store (select v_prenex_5 main_~l~0.base) .cse1 v_prenex_4) .cse2 v_prenex_6) main_~l~0.offset .cse3)) |#memory_int|) .cse0 (not (= v_prenex_6 (_ bv2 32)))))) [2018-11-23 11:19:26,461 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= (_ bv0 32) main_~l~0.offset)) (.cse1 (select |#memory_int| main_~l~0.base))) (or (and .cse0 (not (= (bvadd (select .cse1 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (and .cse0 (not (= (_ bv0 32) (select .cse1 (bvadd main_~l~0.offset (_ bv4 32)))))))) [2018-11-23 11:19:26,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1129#true} is VALID [2018-11-23 11:19:26,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {1129#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1129#true} is VALID [2018-11-23 11:19:26,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2018-11-23 11:19:26,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1129#true} #72#return; {1129#true} is VALID [2018-11-23 11:19:26,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {1129#true} call #t~ret14 := main(); {1129#true} is VALID [2018-11-23 11:19:26,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {1129#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1129#true} is VALID [2018-11-23 11:19:26,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {1129#true} goto; {1129#true} is VALID [2018-11-23 11:19:26,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {1129#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {1129#true} is VALID [2018-11-23 11:19:26,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {1129#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {1129#true} is VALID [2018-11-23 11:19:26,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {1129#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1161#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:26,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {1161#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} goto; {1161#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:26,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {1161#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1161#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:26,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {1161#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))) (and (= (_ bv0 32) main_~l~0.offset) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:26,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:26,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short8; {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:26,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} #t~short12 := #t~short8; {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:26,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {1171#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {1184#(and (or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not |main_#t~short11|)) (and (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32)) |main_#t~short11|)) (or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))))} is VALID [2018-11-23 11:19:26,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {1184#(and (or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not |main_#t~short11|)) (and (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32)) |main_#t~short11|)) (or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))))} assume #t~short11;call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short11 := 2bv32 == #t~mem10; {1188#(not |main_#t~short11|)} is VALID [2018-11-23 11:19:26,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {1188#(not |main_#t~short11|)} #t~short12 := #t~short11; {1192#(not |main_#t~short12|)} is VALID [2018-11-23 11:19:26,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {1192#(not |main_#t~short12|)} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1130#false} is VALID [2018-11-23 11:19:26,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {1130#false} assume !false; {1130#false} is VALID [2018-11-23 11:19:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:26,751 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:26,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:26,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:19:26,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:19:26,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:26,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:19:26,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:26,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:19:26,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:19:26,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:19:26,880 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 7 states. [2018-11-23 11:19:28,798 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:19:28,977 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-11-23 11:19:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:29,459 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-23 11:19:29,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:19:29,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:19:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:19:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2018-11-23 11:19:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:19:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2018-11-23 11:19:29,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2018-11-23 11:19:29,577 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:19:29,578 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:19:29,579 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:19:29,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:19:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:19:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-23 11:19:29,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:29,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 37 states. [2018-11-23 11:19:29,665 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 37 states. [2018-11-23 11:19:29,666 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 37 states. [2018-11-23 11:19:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:29,668 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 11:19:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 11:19:29,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:29,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:29,670 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states. [2018-11-23 11:19:29,670 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states. [2018-11-23 11:19:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:29,672 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 11:19:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 11:19:29,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:29,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:29,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:29,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:19:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 11:19:29,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 21 [2018-11-23 11:19:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:29,676 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 11:19:29,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:19:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 11:19:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:19:29,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:29,677 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:29,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:29,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:29,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1654110747, now seen corresponding path program 1 times [2018-11-23 11:19:29,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:29,678 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:19:29,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:29,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:29,840 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:19:29,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:19:29,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:29,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:29,930 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:19:29,981 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:19:30,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 11:19:30,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:19:30,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:19:30,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:19:30,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:19:30,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:30,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:19:30,377 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:30,377 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~i~0.base_9, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_9) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_9) (_ bv0 32)))) (and (= (_ bv0 32) .cse0) (= .cse0 main_~i~0.offset) (= .cse1 main_~i~0.base) (= .cse1 (_ bv0 32)))) [2018-11-23 11:19:30,377 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset)) [2018-11-23 11:19:30,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {1398#true} call ULTIMATE.init(); {1398#true} is VALID [2018-11-23 11:19:30,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {1398#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1398#true} is VALID [2018-11-23 11:19:30,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {1398#true} assume true; {1398#true} is VALID [2018-11-23 11:19:30,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1398#true} {1398#true} #72#return; {1398#true} is VALID [2018-11-23 11:19:30,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {1398#true} call #t~ret14 := main(); {1398#true} is VALID [2018-11-23 11:19:30,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {1398#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1431#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:30,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {1431#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} goto; {1431#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:30,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {1431#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1431#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:30,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {1431#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} #t~short12 := #t~short8; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !#t~short11; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} #t~short12 := #t~short11; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,448 INFO L273 TraceCheckUtils]: 20: Hoare triple {1441#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1466#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,448 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1399#false} is VALID [2018-11-23 11:19:30,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {1399#false} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1399#false} is VALID [2018-11-23 11:19:30,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {1399#false} #t~short12 := #t~short8; {1399#false} is VALID [2018-11-23 11:19:30,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {1399#false} assume #t~short12; {1399#false} is VALID [2018-11-23 11:19:30,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {1399#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1399#false} is VALID [2018-11-23 11:19:30,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {1399#false} assume !false; {1399#false} is VALID [2018-11-23 11:19:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:30,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:30,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {1399#false} assume !false; {1399#false} is VALID [2018-11-23 11:19:30,584 INFO L273 TraceCheckUtils]: 25: Hoare triple {1399#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1399#false} is VALID [2018-11-23 11:19:30,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {1399#false} assume #t~short12; {1399#false} is VALID [2018-11-23 11:19:30,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {1399#false} #t~short12 := #t~short8; {1399#false} is VALID [2018-11-23 11:19:30,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {1399#false} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1399#false} is VALID [2018-11-23 11:19:30,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1399#false} is VALID [2018-11-23 11:19:30,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1466#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:30,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} #t~short12 := #t~short11; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !#t~short11; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} #t~short12 := #t~short8; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {1528#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1503#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:19:30,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {1528#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1528#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:30,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {1528#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} goto; {1528#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:30,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1528#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:19:30,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {1398#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1418#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:30,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {1398#true} call #t~ret14 := main(); {1398#true} is VALID [2018-11-23 11:19:30,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1398#true} {1398#true} #72#return; {1398#true} is VALID [2018-11-23 11:19:30,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {1398#true} assume true; {1398#true} is VALID [2018-11-23 11:19:30,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {1398#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1398#true} is VALID [2018-11-23 11:19:30,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {1398#true} call ULTIMATE.init(); {1398#true} is VALID [2018-11-23 11:19:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:30,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:30,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-23 11:19:30,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:19:30,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:30,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:19:30,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:30,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:19:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:19:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:19:30,661 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 8 states. [2018-11-23 11:19:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:32,966 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2018-11-23 11:19:32,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:19:32,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:19:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:19:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 11:19:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:19:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 11:19:32,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 11:19:33,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:33,123 INFO L225 Difference]: With dead ends: 69 [2018-11-23 11:19:33,124 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:19:33,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:19:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:19:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 11:19:33,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:33,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 11:19:33,167 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:19:33,167 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:19:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:33,169 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 11:19:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 11:19:33,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:33,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:33,170 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 11:19:33,170 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 11:19:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:33,172 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 11:19:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 11:19:33,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:33,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:33,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:33,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:19:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-23 11:19:33,175 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 27 [2018-11-23 11:19:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:33,175 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-23 11:19:33,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:19:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 11:19:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:19:33,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:33,176 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:33,176 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:33,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1074769829, now seen corresponding path program 2 times [2018-11-23 11:19:33,177 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:33,177 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:19:33,205 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:19:33,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:19:33,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:19:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:33,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:33,358 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 39 treesize of output 38 [2018-11-23 11:19:33,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,385 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 39 treesize of output 38 [2018-11-23 11:19:33,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,596 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 38 treesize of output 35 [2018-11-23 11:19:33,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:33,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:33,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,662 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 27 treesize of output 39 [2018-11-23 11:19:33,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,807 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 38 treesize of output 35 [2018-11-23 11:19:33,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:33,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:33,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:33,847 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 27 treesize of output 39 [2018-11-23 11:19:33,862 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,877 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,888 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:33,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:33,969 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:79, output treesize:41 [2018-11-23 11:19:34,014 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:34,014 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, main_~ev1~0, main_~ev2~0, |v_#valid_13|, v_prenex_7, v_prenex_8, v_prenex_9]. (let ((.cse0 (= (_ bv0 32) main_~l~0.offset)) (.cse1 (bvadd main_~l~0.offset (_ bv4 32))) (.cse2 (bvadd main_~l~0.offset (_ bv8 32))) (.cse3 (select (select |#memory_int| main_~l~0.base) main_~l~0.offset)) (.cse4 (= |#valid| (store |v_#valid_13| main_~l~0.base (_ bv1 1))))) (or (and .cse0 (not (= main_~ev1~0 (_ bv1 32))) (= (store |v_#memory_int_14| main_~l~0.base (store (store (store (select |v_#memory_int_14| main_~l~0.base) .cse1 main_~ev1~0) .cse2 main_~ev2~0) main_~l~0.offset .cse3)) |#memory_int|) .cse4) (and (not (= v_prenex_9 (_ bv3 32))) .cse0 (= (store v_prenex_7 main_~l~0.base (store (store (store (select v_prenex_7 main_~l~0.base) .cse1 v_prenex_8) .cse2 v_prenex_9) main_~l~0.offset .cse3)) |#memory_int|) .cse4))) [2018-11-23 11:19:34,015 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= (_ bv0 32) main_~l~0.offset)) (.cse2 (= (_ bv1 1) (select |#valid| main_~l~0.base))) (.cse1 (select |#memory_int| main_~l~0.base))) (or (and .cse0 (not (= (bvadd (select .cse1 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) .cse2) (and .cse0 .cse2 (not (= (_ bv1 32) (select .cse1 (bvadd main_~l~0.offset (_ bv4 32)))))))) [2018-11-23 11:19:34,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:34,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:34,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-11-23 11:19:34,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:36,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:36,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:36,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-11-23 11:19:36,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:38,389 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 65 treesize of output 62 [2018-11-23 11:19:38,402 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:19:38,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:38,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:39,671 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 65 treesize of output 62 [2018-11-23 11:19:39,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:19:39,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:39,761 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-11-23 11:19:40,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:40,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:40,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:40,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:40,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:40,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:40,483 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 27 treesize of output 39 [2018-11-23 11:19:40,485 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,505 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,518 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,556 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,879 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 61 treesize of output 58 [2018-11-23 11:19:40,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:19:40,892 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,949 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:41,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 11:19:41,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:41,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:41,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:41,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:41,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:41,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:41,248 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 27 treesize of output 39 [2018-11-23 11:19:41,281 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:41,317 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:41,328 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:41,368 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:41,513 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 58 treesize of output 55 [2018-11-23 11:19:41,533 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:19:41,534 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:41,571 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:41,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:41,662 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 14 variables, input treesize:143, output treesize:67 [2018-11-23 11:19:43,669 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:43,670 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~ev1~0, main_~ev2~0, v_main_~l~0.base_8, |v_#valid_14|, |v_#memory_$Pointer$.offset_12|, |v_#memory_$Pointer$.base_12|, v_prenex_15, v_prenex_11, v_prenex_12, v_prenex_10, v_prenex_14, v_prenex_16, v_prenex_13]. (let ((.cse0 (= (_ bv0 32) main_~l~0.offset)) (.cse1 (bvadd main_~l~0.offset (_ bv4 32))) (.cse2 (bvadd main_~l~0.offset (_ bv8 32))) (.cse3 (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) (or (and (not (= (bvadd (select (select |v_#memory_int_15| v_main_~l~0.base_8) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (select |v_#valid_14| v_main_~l~0.base_8) (_ bv1 1)) (= (store |v_#memory_$Pointer$.offset_12| main_~l~0.base (store (select |v_#memory_$Pointer$.offset_12| main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) .cse0 (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_12| main_~l~0.base (store (select |v_#memory_$Pointer$.base_12| main_~l~0.base) main_~l~0.offset v_main_~l~0.base_8))) (= |#memory_int| (store |v_#memory_int_15| main_~l~0.base (store (store (store (select |v_#memory_int_15| main_~l~0.base) .cse1 main_~ev1~0) .cse2 main_~ev2~0) main_~l~0.offset .cse3))) (= (_ bv0 1) (select |v_#valid_14| main_~l~0.base))) (and (= (store v_prenex_10 main_~l~0.base (store (select v_prenex_10 main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (not (= (bvadd (select (select v_prenex_15 v_prenex_14) (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) .cse0 (= (select v_prenex_16 v_prenex_14) (_ bv1 1)) (= (_ bv0 1) (select v_prenex_16 main_~l~0.base)) (= |#memory_$Pointer$.base| (store v_prenex_13 main_~l~0.base (store (select v_prenex_13 main_~l~0.base) main_~l~0.offset v_prenex_14))) (= |#memory_int| (store v_prenex_15 main_~l~0.base (store (store (store (select v_prenex_15 main_~l~0.base) .cse1 v_prenex_11) .cse2 v_prenex_12) main_~l~0.offset .cse3)))))) [2018-11-23 11:19:43,670 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse4 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (let ((.cse0 (select |#memory_int| .cse4)) (.cse1 (= (_ bv0 32) main_~l~0.offset)) (.cse2 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (.cse3 (not (= .cse4 main_~l~0.base)))) (or (and (not (= (bvadd (select .cse0 (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) .cse1 .cse2 .cse3) (and (not (= (bvadd (select .cse0 (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) .cse1 .cse2 .cse3)))) [2018-11-23 11:19:44,012 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 44 treesize of output 40 [2018-11-23 11:19:44,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:19:44,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,077 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 33 treesize of output 27 [2018-11-23 11:19:44,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-11-23 11:19:44,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,134 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 42 treesize of output 38 [2018-11-23 11:19:44,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:19:44,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,164 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,198 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 31 treesize of output 25 [2018-11-23 11:19:44,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:19:44,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,216 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:44,244 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:87, output treesize:27 [2018-11-23 11:19:44,251 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:44,251 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_19, v_prenex_17, v_prenex_18, |#memory_$Pointer$.offset|, v_main_~i~0.base_12, |#memory_$Pointer$.base|]. (or (let ((.cse1 (select (select v_prenex_18 v_prenex_17) (_ bv0 32))) (.cse0 (select (select v_prenex_19 v_prenex_17) (_ bv0 32)))) (and (not (= .cse0 v_prenex_17)) (not (= (bvadd (select (select |#memory_int| .cse0) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) .cse1) (= .cse1 main_~i~0.offset) (= .cse0 main_~i~0.base))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_12) (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_12) (_ bv0 32)))) (and (= .cse2 main_~i~0.offset) (not (= (_ bv3 32) (select (select |#memory_int| .cse3) (_ bv8 32)))) (= (_ bv0 32) .cse2) (= .cse3 main_~i~0.base) (not (= .cse3 v_main_~i~0.base_12))))) [2018-11-23 11:19:44,252 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| main_~i~0.base)) (.cse1 (= (_ bv0 32) main_~i~0.offset))) (or (and (not (= (_ bv0 32) (bvadd (select .cse0 (_ bv4 32)) (_ bv4294967295 32)))) .cse1) (and (not (= (_ bv3 32) (select .cse0 (_ bv8 32)))) .cse1))) [2018-11-23 11:19:44,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2018-11-23 11:19:44,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {1790#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1790#true} is VALID [2018-11-23 11:19:44,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-23 11:19:44,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #72#return; {1790#true} is VALID [2018-11-23 11:19:44,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret14 := main(); {1790#true} is VALID [2018-11-23 11:19:44,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {1790#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1790#true} is VALID [2018-11-23 11:19:44,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {1790#true} goto; {1790#true} is VALID [2018-11-23 11:19:44,420 INFO L273 TraceCheckUtils]: 7: Hoare triple {1790#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {1790#true} is VALID [2018-11-23 11:19:44,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {1790#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {1790#true} is VALID [2018-11-23 11:19:44,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {1790#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:44,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} goto; {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:44,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:44,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:19:44,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {1822#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1835#(or (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} is VALID [2018-11-23 11:19:44,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {1835#(or (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} goto; {1835#(or (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} is VALID [2018-11-23 11:19:44,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {1835#(or (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1835#(or (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} is VALID [2018-11-23 11:19:44,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {1835#(or (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)) (_ bv4294967293 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} #t~short12 := #t~short8; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short11; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} #t~short12 := #t~short11; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,437 INFO L273 TraceCheckUtils]: 23: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {1845#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1870#(or (and (not (= (_ bv1 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:19:44,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {1870#(or (and (not (= (_ bv1 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1874#(and (or (and (not (= (_ bv1 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset))) (or (and |main_#t~short8| (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (and (not |main_#t~short8|) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))))))} is VALID [2018-11-23 11:19:44,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {1874#(and (or (and (not (= (_ bv1 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset))) (or (and |main_#t~short8| (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (and (not |main_#t~short8|) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))))))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1878#(not |main_#t~short8|)} is VALID [2018-11-23 11:19:44,476 INFO L273 TraceCheckUtils]: 27: Hoare triple {1878#(not |main_#t~short8|)} #t~short12 := #t~short8; {1882#(not |main_#t~short12|)} is VALID [2018-11-23 11:19:44,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {1882#(not |main_#t~short12|)} assume #t~short12; {1791#false} is VALID [2018-11-23 11:19:44,490 INFO L273 TraceCheckUtils]: 29: Hoare triple {1791#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1791#false} is VALID [2018-11-23 11:19:44,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2018-11-23 11:19:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:44,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:45,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:45,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:45,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:45,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:55 [2018-11-23 11:19:45,358 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:45,358 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_main_~l~0.base_9, main_~ev1~0, main_~ev2~0, |v_#memory_int_16|]. (let ((.cse0 (select |v_#memory_int_16| main_~l~0.base))) (or (not (= (bvadd (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))) (not (= (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) (select (select |v_#memory_int_16| v_main_~l~0.base_9) (_ bv0 32)))) |v_#memory_int_16|)) (not (= (bvadd (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9))))) [2018-11-23 11:19:45,358 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~l~0.base_9, main_~ev1~0, main_~ev2~0, v_DerPreprocessor_2]. (let ((.cse0 (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base))) (or (not (= (_ bv3 32) (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9))) (not (= (_ bv1 32) (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))))))) [2018-11-23 11:19:45,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2018-11-23 11:19:45,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {1791#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1791#false} is VALID [2018-11-23 11:19:45,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {1882#(not |main_#t~short12|)} assume #t~short12; {1791#false} is VALID [2018-11-23 11:19:45,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {1878#(not |main_#t~short8|)} #t~short12 := #t~short8; {1882#(not |main_#t~short12|)} is VALID [2018-11-23 11:19:45,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {1904#(or (not |main_#t~short8|) (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1878#(not |main_#t~short8|)} is VALID [2018-11-23 11:19:45,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {1908#(or (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1904#(or (not |main_#t~short8|) (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1908#(or (not (= (_ bv3 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))) (not (= (bvadd (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:19:45,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} #t~short12 := #t~short11; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !#t~short11; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} #t~short12 := #t~short8; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {1937#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1912#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))))) (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:19:45,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {1937#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1937#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:19:45,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {1937#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))} goto; {1937#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:19:45,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1937#(or (not (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:19:45,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} is VALID [2018-11-23 11:19:45,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} is VALID [2018-11-23 11:19:45,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} goto; {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} is VALID [2018-11-23 11:19:45,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {1790#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {1947#(forall ((main_~ev1~0 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~l~0.base_9 (_ BitVec 32))) (or (not (= (_ bv3 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (_ bv1 32) (select (select (store |#memory_int| v_main_~l~0.base_9 (store (store (store (select |#memory_int| v_main_~l~0.base_9) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_2)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (_ bv0 1) (select |#valid| v_main_~l~0.base_9)))))} is VALID [2018-11-23 11:19:45,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {1790#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {1790#true} is VALID [2018-11-23 11:19:45,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {1790#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {1790#true} is VALID [2018-11-23 11:19:45,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {1790#true} goto; {1790#true} is VALID [2018-11-23 11:19:45,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {1790#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {1790#true} is VALID [2018-11-23 11:19:45,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret14 := main(); {1790#true} is VALID [2018-11-23 11:19:45,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #72#return; {1790#true} is VALID [2018-11-23 11:19:45,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2018-11-23 11:19:45,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {1790#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1790#true} is VALID [2018-11-23 11:19:45,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2018-11-23 11:19:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:45,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:45,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 11:19:45,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-23 11:19:45,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:45,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:19:46,303 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:19:46,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:19:46,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:19:46,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:19:46,304 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 14 states. [2018-11-23 11:19:48,661 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 11:19:49,239 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-23 11:19:50,367 WARN L180 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-11-23 11:19:52,981 WARN L180 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-23 11:19:53,480 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-11-23 11:19:54,020 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-11-23 11:19:54,608 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 11:19:55,278 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2018-11-23 11:19:55,737 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2018-11-23 11:19:56,115 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2018-11-23 11:19:56,588 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-11-23 11:19:56,949 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-11-23 11:19:57,277 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2018-11-23 11:19:57,910 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-23 11:19:58,192 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-11-23 11:19:58,431 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-23 11:19:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:58,612 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2018-11-23 11:19:58,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:19:58,612 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-23 11:19:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:19:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2018-11-23 11:19:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:19:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2018-11-23 11:19:58,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 91 transitions. [2018-11-23 11:19:58,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:58,867 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:19:58,867 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:19:58,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=274, Invalid=596, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:19:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:19:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-23 11:19:58,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:58,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 49 states. [2018-11-23 11:19:58,946 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 49 states. [2018-11-23 11:19:58,946 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 49 states. [2018-11-23 11:19:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:58,950 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 11:19:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-23 11:19:58,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:58,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:58,950 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 67 states. [2018-11-23 11:19:58,951 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 67 states. [2018-11-23 11:19:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:58,953 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 11:19:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-23 11:19:58,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:58,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:58,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:58,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:19:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2018-11-23 11:19:58,956 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 31 [2018-11-23 11:19:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:58,956 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2018-11-23 11:19:58,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:19:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-23 11:19:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:19:58,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:58,957 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:58,957 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:58,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:58,958 INFO L82 PathProgramCache]: Analyzing trace with hash -285041437, now seen corresponding path program 1 times [2018-11-23 11:19:58,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:58,958 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:19:58,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:19:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:59,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:59,146 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 39 treesize of output 38 [2018-11-23 11:19:59,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,155 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 39 treesize of output 38 [2018-11-23 11:19:59,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,325 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 38 treesize of output 35 [2018-11-23 11:19:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:59,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:59,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,364 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 27 treesize of output 39 [2018-11-23 11:19:59,366 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,533 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 38 treesize of output 35 [2018-11-23 11:19:59,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:19:59,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:19:59,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,597 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 27 treesize of output 39 [2018-11-23 11:19:59,600 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,614 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,624 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,647 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:59,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:19:59,705 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:79, output treesize:41 [2018-11-23 11:19:59,770 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:59,771 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_22, v_prenex_20, v_prenex_21, |v_#valid_20|, |v_#memory_int_18|, main_~ev1~0, main_~ev2~0]. (let ((.cse0 (= |#valid| (store |v_#valid_20| main_~l~0.base (_ bv1 1)))) (.cse1 (= (_ bv0 32) main_~l~0.offset)) (.cse2 (bvadd main_~l~0.offset (_ bv4 32))) (.cse3 (bvadd main_~l~0.offset (_ bv8 32))) (.cse4 (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) (or (and .cse0 .cse1 (not (= v_prenex_20 (_ bv0 32))) (= (store v_prenex_22 main_~l~0.base (store (store (store (select v_prenex_22 main_~l~0.base) .cse2 v_prenex_20) .cse3 v_prenex_21) main_~l~0.offset .cse4)) |#memory_int|)) (and .cse0 (not (= main_~ev2~0 (_ bv2 32))) .cse1 (= (store |v_#memory_int_18| main_~l~0.base (store (store (store (select |v_#memory_int_18| main_~l~0.base) .cse2 main_~ev1~0) .cse3 main_~ev2~0) main_~l~0.offset .cse4)) |#memory_int|)))) [2018-11-23 11:19:59,771 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= (_ bv0 32) main_~l~0.offset)) (.cse2 (= (_ bv1 1) (select |#valid| main_~l~0.base))) (.cse1 (select |#memory_int| main_~l~0.base))) (or (and .cse0 (not (= (bvadd (select .cse1 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) .cse2) (and .cse0 .cse2 (not (= (_ bv0 32) (select .cse1 (bvadd main_~l~0.offset (_ bv4 32)))))))) [2018-11-23 11:19:59,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:59,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-23 11:19:59,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:02,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:02,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:02,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-11-23 11:20:02,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:04,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 62 [2018-11-23 11:20:04,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:20:04,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:04,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:20:04,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:04,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:04,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:04,971 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 27 treesize of output 39 [2018-11-23 11:20:04,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:05,006 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:05,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:05,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:06,047 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 58 treesize of output 55 [2018-11-23 11:20:06,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:20:06,058 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:06,095 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:06,631 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 54 treesize of output 51 [2018-11-23 11:20:06,644 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:20:06,645 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:06,682 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,033 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 63 treesize of output 60 [2018-11-23 11:20:07,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:20:07,094 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,186 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-11-23 11:20:07,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:20:07,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:07,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:20:07,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:07,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:07,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:07,505 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 27 treesize of output 39 [2018-11-23 11:20:07,523 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,543 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,557 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,599 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,710 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 56 treesize of output 53 [2018-11-23 11:20:07,718 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:20:07,723 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,756 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:07,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:07,849 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 14 variables, input treesize:141, output treesize:63 [2018-11-23 11:20:09,757 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:09,757 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_27, v_prenex_23, v_prenex_24, v_prenex_25, v_prenex_28, v_prenex_26, v_prenex_29, |v_#memory_int_19|, main_~ev1~0, main_~ev2~0, v_main_~l~0.base_11, |v_#valid_21|, |v_#memory_$Pointer$.base_15|, |v_#memory_$Pointer$.offset_15|]. (let ((.cse1 (bvadd main_~l~0.offset (_ bv4 32))) (.cse2 (bvadd main_~l~0.offset (_ bv8 32))) (.cse3 (select (select |#memory_int| main_~l~0.base) main_~l~0.offset)) (.cse0 (= (_ bv0 32) main_~l~0.offset))) (or (and .cse0 (= (_ bv1 1) (select v_prenex_25 v_prenex_28)) (= (store v_prenex_27 main_~l~0.base (store (store (store (select v_prenex_27 main_~l~0.base) .cse1 v_prenex_23) .cse2 v_prenex_24) main_~l~0.offset .cse3)) |#memory_int|) (= |#memory_$Pointer$.base| (store v_prenex_26 main_~l~0.base (store (select v_prenex_26 main_~l~0.base) main_~l~0.offset v_prenex_28))) (not (= (bvadd (select (select v_prenex_27 v_prenex_28) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (store v_prenex_29 main_~l~0.base (store (select v_prenex_29 main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select v_prenex_25 main_~l~0.base))) (and (not (= (select (select |v_#memory_int_19| v_main_~l~0.base_11) (_ bv4 32)) (_ bv0 32))) (= (_ bv1 1) (select |v_#valid_21| v_main_~l~0.base_11)) (= (store |v_#memory_int_19| main_~l~0.base (store (store (store (select |v_#memory_int_19| main_~l~0.base) .cse1 main_~ev1~0) .cse2 main_~ev2~0) main_~l~0.offset .cse3)) |#memory_int|) .cse0 (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_15| main_~l~0.base (store (select |v_#memory_$Pointer$.base_15| main_~l~0.base) main_~l~0.offset v_main_~l~0.base_11))) (= (_ bv0 1) (select |v_#valid_21| main_~l~0.base)) (= (store |v_#memory_$Pointer$.offset_15| main_~l~0.base (store (select |v_#memory_$Pointer$.offset_15| main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|)))) [2018-11-23 11:20:09,757 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse4 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (let ((.cse0 (select |#memory_int| .cse4)) (.cse1 (= (_ bv0 32) main_~l~0.offset)) (.cse2 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (.cse3 (not (= .cse4 main_~l~0.base)))) (or (and (not (= (_ bv2 32) (select .cse0 (_ bv8 32)))) .cse1 .cse2 .cse3) (and (not (= (_ bv0 32) (select .cse0 (_ bv4 32)))) .cse1 .cse2 .cse3)))) [2018-11-23 11:20:09,934 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 42 treesize of output 38 [2018-11-23 11:20:09,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:20:09,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:09,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,003 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 42 treesize of output 36 [2018-11-23 11:20:10,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:20:10,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,059 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 31 treesize of output 25 [2018-11-23 11:20:10,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:20:10,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,077 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 11:20:10,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:20:10,117 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,127 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:20:10,152 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:85, output treesize:25 [2018-11-23 11:20:10,157 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:10,157 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_32, v_prenex_30, v_prenex_31, |#memory_$Pointer$.base|, v_main_~i~0.base_15, |#memory_$Pointer$.offset|]. (or (let ((.cse1 (select (select v_prenex_31 v_prenex_30) (_ bv0 32))) (.cse0 (select (select v_prenex_32 v_prenex_30) (_ bv0 32)))) (and (= .cse0 main_~i~0.base) (= .cse1 main_~i~0.offset) (= (_ bv0 32) .cse1) (not (= v_prenex_30 .cse0)) (not (= (_ bv2 32) (select (select |#memory_int| .cse0) (_ bv8 32)))))) (let ((.cse3 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_15) (_ bv0 32))) (.cse2 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_15) (_ bv0 32)))) (and (not (= v_main_~i~0.base_15 .cse2)) (not (= (select (select |#memory_int| .cse2) (_ bv4 32)) (_ bv0 32))) (= .cse3 main_~i~0.offset) (= (_ bv0 32) .cse3) (= .cse2 main_~i~0.base)))) [2018-11-23 11:20:10,158 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| main_~i~0.base)) (.cse1 (= (_ bv0 32) main_~i~0.offset))) (or (and (not (= (select .cse0 (_ bv4 32)) (_ bv0 32))) .cse1) (and (not (= (_ bv2 32) (select .cse0 (_ bv8 32)))) .cse1))) [2018-11-23 11:20:10,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2314#true} is VALID [2018-11-23 11:20:10,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {2314#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2314#true} is VALID [2018-11-23 11:20:10,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2018-11-23 11:20:10,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #72#return; {2314#true} is VALID [2018-11-23 11:20:10,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret14 := main(); {2314#true} is VALID [2018-11-23 11:20:10,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {2314#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {2314#true} is VALID [2018-11-23 11:20:10,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {2314#true} goto; {2314#true} is VALID [2018-11-23 11:20:10,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {2314#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {2314#true} is VALID [2018-11-23 11:20:10,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {2314#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {2314#true} is VALID [2018-11-23 11:20:10,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {2314#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:10,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} goto; {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:10,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:10,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:20:10,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {2346#(or (and (= (_ bv0 32) main_~l~0.offset) (not (= (bvadd (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (not (= (_ bv0 32) (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2359#(or (and (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} is VALID [2018-11-23 11:20:10,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {2359#(or (and (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} goto; {2359#(or (and (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} is VALID [2018-11-23 11:20:10,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {2359#(or (and (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2359#(or (and (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} is VALID [2018-11-23 11:20:10,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {2359#(or (and (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv8 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))) (and (not (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} #t~short12 := #t~short8; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short11; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} #t~short12 := #t~short11; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {2369#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset) main_~i~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) main_~i~0.offset)))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short8; {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} #t~short12 := #t~short8; {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} is VALID [2018-11-23 11:20:10,712 INFO L273 TraceCheckUtils]: 28: Hoare triple {2394#(or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset)))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {2407#(and (or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not |main_#t~short11|)) (and (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32)) |main_#t~short11|)) (or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset))))} is VALID [2018-11-23 11:20:10,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {2407#(and (or (and (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not |main_#t~short11|)) (and (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32)) |main_#t~short11|)) (or (and (not (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset)) (and (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (_ bv8 32)))) (= (_ bv0 32) main_~i~0.offset))))} assume #t~short11;call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short11 := 2bv32 == #t~mem10; {2411#(not |main_#t~short11|)} is VALID [2018-11-23 11:20:10,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {2411#(not |main_#t~short11|)} #t~short12 := #t~short11; {2415#(not |main_#t~short12|)} is VALID [2018-11-23 11:20:10,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {2415#(not |main_#t~short12|)} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {2315#false} is VALID [2018-11-23 11:20:10,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2018-11-23 11:20:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:10,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:12,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:12,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:12,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:12,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:57 [2018-11-23 11:20:12,120 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:12,120 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_main_~l~0.base_12, main_~ev1~0, main_~ev2~0, |v_#memory_int_20|]. (let ((.cse0 (select |v_#memory_int_20| main_~l~0.base))) (or (not (= (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= |v_#memory_int_20| (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) (select (select |v_#memory_int_20| v_main_~l~0.base_12) (_ bv0 32)))))))) [2018-11-23 11:20:12,121 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~l~0.base_12, main_~ev1~0, main_~ev2~0, v_DerPreprocessor_4]. (let ((.cse0 (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base))) (or (not (= (_ bv0 32) (select .cse0 (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select .cse0 (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))))) [2018-11-23 11:20:14,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {2315#false} assume !false; {2315#false} is VALID [2018-11-23 11:20:14,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {2415#(not |main_#t~short12|)} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {2315#false} is VALID [2018-11-23 11:20:14,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {2411#(not |main_#t~short11|)} #t~short12 := #t~short11; {2415#(not |main_#t~short12|)} is VALID [2018-11-23 11:20:14,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {2431#(or (not |main_#t~short11|) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} assume #t~short11;call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short11 := 2bv32 == #t~mem10; {2411#(not |main_#t~short11|)} is VALID [2018-11-23 11:20:14,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {2431#(or (not |main_#t~short11|) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,262 INFO L273 TraceCheckUtils]: 27: Hoare triple {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} #t~short12 := #t~short8; {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} assume !#t~short8; {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2435#(or (not (= (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} #t~short12 := #t~short11; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !#t~short11; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} #t~short12 := #t~short8; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {2473#(or (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (_ bv0 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2448#(or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) (_ bv0 32))) (not (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv8 32))))))} is VALID [2018-11-23 11:20:14,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {2473#(or (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (_ bv0 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2473#(or (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:14,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {2473#(or (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (_ bv0 32))))} goto; {2473#(or (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:14,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2473#(or (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (_ bv0 32))))} is VALID [2018-11-23 11:20:14,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:20:14,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:20:14,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} goto; {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:20:14,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {2314#true} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2483#(forall ((main_~ev1~0 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (main_~ev2~0 (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (= (bvadd (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) main_~ev1~0) (_ bv8 32) main_~ev2~0) (_ bv0 32) v_DerPreprocessor_4)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:20:14,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {2314#true} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {2314#true} is VALID [2018-11-23 11:20:14,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {2314#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {2314#true} is VALID [2018-11-23 11:20:14,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {2314#true} goto; {2314#true} is VALID [2018-11-23 11:20:14,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {2314#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {2314#true} is VALID [2018-11-23 11:20:14,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {2314#true} call #t~ret14 := main(); {2314#true} is VALID [2018-11-23 11:20:14,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2314#true} {2314#true} #72#return; {2314#true} is VALID [2018-11-23 11:20:14,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {2314#true} assume true; {2314#true} is VALID [2018-11-23 11:20:14,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {2314#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2314#true} is VALID [2018-11-23 11:20:14,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {2314#true} call ULTIMATE.init(); {2314#true} is VALID [2018-11-23 11:20:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:14,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:14,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 11:20:14,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:20:14,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:14,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:20:14,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:14,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:20:14,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:20:14,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=148, Unknown=1, NotChecked=0, Total=182 [2018-11-23 11:20:14,654 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 14 states. [2018-11-23 11:20:17,430 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-23 11:20:18,038 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2018-11-23 11:20:20,975 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2018-11-23 11:20:21,480 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-23 11:20:22,088 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2018-11-23 11:20:22,655 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-11-23 11:20:23,207 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2018-11-23 11:20:23,597 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-11-23 11:20:23,996 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2018-11-23 11:20:24,461 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-23 11:20:24,722 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 11:20:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:24,898 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-23 11:20:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:20:24,899 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:20:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:20:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2018-11-23 11:20:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:20:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2018-11-23 11:20:24,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 67 transitions. [2018-11-23 11:20:25,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:25,097 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:20:25,098 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:20:25,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=187, Invalid=412, Unknown=1, NotChecked=0, Total=600 [2018-11-23 11:20:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:20:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-23 11:20:25,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:25,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2018-11-23 11:20:25,179 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2018-11-23 11:20:25,179 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2018-11-23 11:20:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:25,183 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 11:20:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 11:20:25,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:25,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:25,184 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2018-11-23 11:20:25,184 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2018-11-23 11:20:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:25,186 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 11:20:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 11:20:25,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:25,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:25,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:25,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:20:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2018-11-23 11:20:25,188 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 33 [2018-11-23 11:20:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:25,189 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2018-11-23 11:20:25,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:20:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2018-11-23 11:20:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:20:25,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:25,190 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:25,190 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:25,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1321241351, now seen corresponding path program 3 times [2018-11-23 11:20:25,191 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:25,215 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:20:25,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:20:25,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:20:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:25,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:25,448 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:20:25,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,479 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:20:25,483 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:20:25,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,510 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:20:25,514 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:20:25,516 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,520 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,530 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-11-23 11:20:25,578 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:25,578 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_18|, |v_#valid_27|, |v_#memory_$Pointer$.base_18|]. (and (= (store |v_#memory_$Pointer$.offset_18| main_~l~0.base (store (select |v_#memory_$Pointer$.offset_18| main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#valid| (store |v_#valid_27| main_~l~0.base (_ bv1 1))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_18| main_~l~0.base (store (select |v_#memory_$Pointer$.base_18| main_~l~0.base) main_~l~0.offset (_ bv0 32))))) [2018-11-23 11:20:25,578 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) [2018-11-23 11:20:25,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:25,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:25,741 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-11-23 11:20:25,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:20:25,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:26,943 INFO L303 Elim1Store]: Index analysis took 242 ms [2018-11-23 11:20:26,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 11:20:26,975 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 16 treesize of output 1 [2018-11-23 11:20:26,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,416 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:27,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:27,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 11:20:27,805 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 16 treesize of output 1 [2018-11-23 11:20:27,808 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,959 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:27,969 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:28,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-23 11:20:28,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 11:20:28,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:28,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:20:28,112 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,132 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,162 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-23 11:20:28,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 11:20:28,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:28,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:20:28,258 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,274 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,293 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,336 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:126, output treesize:42 [2018-11-23 11:20:30,380 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:30,381 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_20|, v_main_~l~0.base_15, |v_#memory_$Pointer$.base_21|, v_main_~l~0.offset_15, |v_#valid_28|, |v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.offset_20|, |v_#memory_$Pointer$.offset_19|]. (let ((.cse1 (bvadd main_~l~0.offset (_ bv8 32))) (.cse3 (select |v_#memory_$Pointer$.offset_19| main_~l~0.base)) (.cse0 (select |v_#memory_$Pointer$.base_19| main_~l~0.base)) (.cse5 (bvadd main_~l~0.offset (_ bv4 32))) (.cse2 (select |v_#memory_$Pointer$.base_20| main_~l~0.base)) (.cse4 (select |v_#memory_$Pointer$.offset_20| main_~l~0.base))) (and (= (_ bv0 32) (select (select |v_#memory_$Pointer$.base_21| v_main_~l~0.base_15) v_main_~l~0.offset_15)) (= (_ bv0 1) (select |v_#valid_28| main_~l~0.base)) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_21| v_main_~l~0.base_15) v_main_~l~0.offset_15)) (= |v_#memory_$Pointer$.base_20| (store |v_#memory_$Pointer$.base_19| main_~l~0.base (store .cse0 .cse1 (select .cse2 .cse1)))) (= |v_#memory_$Pointer$.offset_20| (store |v_#memory_$Pointer$.offset_19| main_~l~0.base (store .cse3 .cse1 (select .cse4 .cse1)))) (= (_ bv0 32) main_~l~0.offset) (= |v_#memory_$Pointer$.offset_19| (store |v_#memory_$Pointer$.offset_21| main_~l~0.base (store (select |v_#memory_$Pointer$.offset_21| main_~l~0.base) .cse5 (select .cse3 .cse5)))) (= (store |v_#memory_$Pointer$.base_21| main_~l~0.base (store (select |v_#memory_$Pointer$.base_21| main_~l~0.base) .cse5 (select .cse0 .cse5))) |v_#memory_$Pointer$.base_19|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_20| main_~l~0.base (store .cse2 main_~l~0.offset v_main_~l~0.base_15))) (= (store |v_#memory_$Pointer$.offset_20| main_~l~0.base (store .cse4 main_~l~0.offset v_main_~l~0.offset_15)) |#memory_$Pointer$.offset|) (= (select |v_#valid_28| v_main_~l~0.base_15) (_ bv1 1)))) [2018-11-23 11:20:30,381 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))) (and (= (_ bv0 32) main_~l~0.offset) (not (= .cse0 main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) [2018-11-23 11:20:30,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-11-23 11:20:30,624 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-11-23 11:20:30,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:30,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:20:30,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:30,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 11:20:30,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:20:30,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-23 11:20:30,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:30,709 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2018-11-23 11:20:30,715 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:30,715 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~i~0.base_18, |#memory_$Pointer$.offset|]. (let ((.cse2 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (and (= .cse0 main_~i~0.base) (= (_ bv0 32) .cse1) (= .cse0 (_ bv0 32)) (= .cse1 main_~i~0.offset) (not (= .cse2 v_main_~i~0.base_18))))) [2018-11-23 11:20:30,715 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset)) [2018-11-23 11:20:30,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {2808#true} call ULTIMATE.init(); {2808#true} is VALID [2018-11-23 11:20:30,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {2808#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2808#true} is VALID [2018-11-23 11:20:30,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {2808#true} assume true; {2808#true} is VALID [2018-11-23 11:20:30,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2808#true} {2808#true} #72#return; {2808#true} is VALID [2018-11-23 11:20:30,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {2808#true} call #t~ret14 := main(); {2808#true} is VALID [2018-11-23 11:20:30,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {2808#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32; {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:30,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} goto; {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:30,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:30,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:30,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {2828#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:30,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} goto; {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:30,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;~ev1~0 := #t~nondet3;havoc #t~nondet3;~ev2~0 := #t~nondet4;havoc #t~nondet4; {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:30,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(((~bvslt32(~ev1~0, 0bv32) || ~bvsgt32(~ev1~0, 3bv32)) || ~bvslt32(~ev2~0, 0bv32)) || ~bvsgt32(~ev2~0, 3bv32)); {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:30,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {2841#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(((0bv32 == ~ev1~0 && 2bv32 == ~ev2~0) || (1bv32 == ~ev1~0 && 3bv32 == ~ev2~0)) || (0bv32 == ~ev1~0 && 3bv32 == ~ev2~0));call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12bv32);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(~ev1~0, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call write~intINTTYPE4(~ev2~0, ~p~0.base, ~bvadd32(8bv32, ~p~0.offset), 4bv32);call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset; {2854#(and (= (_ bv0 32) main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))))} is VALID [2018-11-23 11:20:30,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {2854#(and (= (_ bv0 32) main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))))} goto; {2854#(and (= (_ bv0 32) main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))))} is VALID [2018-11-23 11:20:30,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {2854#(and (= (_ bv0 32) main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2854#(and (= (_ bv0 32) main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))))} is VALID [2018-11-23 11:20:30,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {2854#(and (= (_ bv0 32) main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} #t~short12 := #t~short8; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} assume !#t~short11; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} #t~short12 := #t~short11; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {2864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32))) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} #t~short12 := #t~short8; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} assume !#t~short12;call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short11 := 0bv32 == #t~mem9; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} assume !#t~short11; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} #t~short12 := #t~short11; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} assume !#t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} is VALID [2018-11-23 11:20:30,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {2889#(exists ((v_main_~i~0.base_18 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.base) (= (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_18) (_ bv0 32)) main_~i~0.offset) (not (= (select (select |#memory_$Pointer$.base| v_main_~i~0.base_18) (_ bv0 32)) v_main_~i~0.base_18))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2914#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:30,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {2914#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem6 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32);#t~short8 := 1bv32 == #t~mem6; {2809#false} is VALID [2018-11-23 11:20:30,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {2809#false} assume #t~short8;call #t~mem7 := read~intINTTYPE4(~i~0.base, ~bvadd32(8bv32, ~i~0.offset), 4bv32);#t~short8 := 3bv32 == #t~mem7; {2809#false} is VALID [2018-11-23 11:20:30,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {2809#false} #t~short12 := #t~short8; {2809#false} is VALID [2018-11-23 11:20:30,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {2809#false} assume #t~short12; {2809#false} is VALID [2018-11-23 11:20:30,782 INFO L273 TraceCheckUtils]: 37: Hoare triple {2809#false} assume #t~short12;havoc #t~mem6;havoc #t~mem10;havoc #t~short8;havoc #t~short12;havoc #t~mem9;havoc #t~short11;havoc #t~mem7; {2809#false} is VALID [2018-11-23 11:20:30,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {2809#false} assume !false; {2809#false} is VALID [2018-11-23 11:20:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:30,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:42,278 WARN L180 SmtUtils]: Spent 8.93 s on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2018-11-23 11:20:42,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:42,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:42,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:42,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:47,798 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:47,799 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:20:47,804 INFO L168 Benchmark]: Toolchain (without parser) took 93713.51 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -505.9 MB). Peak memory consumption was 559.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:20:47,805 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:20:47,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:20:47,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:20:47,806 INFO L168 Benchmark]: Boogie Preprocessor took 41.43 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:20:47,806 INFO L168 Benchmark]: RCFGBuilder took 738.84 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:20:47,806 INFO L168 Benchmark]: TraceAbstraction took 92219.66 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 358.1 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 222.9 MB). Peak memory consumption was 581.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:20:47,808 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 598.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.43 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 738.84 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92219.66 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 358.1 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 222.9 MB). Peak memory consumption was 581.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...