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/reducercommutativity/sep_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:25:01,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:25:01,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:25:01,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:25:01,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:25:01,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:25:01,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:25:01,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:25:01,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:25:01,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:25:01,935 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:25:01,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:25:01,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:25:01,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:25:01,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:25:01,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:25:01,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:25:01,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:25:01,944 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:25:01,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:25:01,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:25:01,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:25:01,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:25:01,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:25:01,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:25:01,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:25:01,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:25:01,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:25:01,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:25:01,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:25:01,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:25:01,967 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:25:01,968 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:25:01,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:25:01,969 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:25:01,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:25:01,971 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 10:25:02,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:25:02,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:25:02,007 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:25:02,007 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:25:02,008 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:25:02,009 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:25:02,009 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:25:02,009 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:25:02,009 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:25:02,010 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:25:02,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:25:02,010 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:25:02,010 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:25:02,010 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:25:02,011 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:25:02,012 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:25:02,012 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:25:02,012 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:25:02,014 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:25:02,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:25:02,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:25:02,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:25:02,014 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:25:02,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:25:02,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:25:02,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:25:02,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:25:02,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:25:02,016 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:25:02,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:25:02,017 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:25:02,017 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:25:02,017 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:25:02,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:25:02,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:25:02,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:25:02,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:25:02,094 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:25:02,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-23 10:25:02,151 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881e6a546/f68b95c3fa65422ab14e16c7c2860bff/FLAGcab931516 [2018-11-23 10:25:02,644 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:25:02,645 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-23 10:25:02,653 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881e6a546/f68b95c3fa65422ab14e16c7c2860bff/FLAGcab931516 [2018-11-23 10:25:03,002 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881e6a546/f68b95c3fa65422ab14e16c7c2860bff [2018-11-23 10:25:03,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:25:03,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:25:03,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:03,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:25:03,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:25:03,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34976cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03, skipping insertion in model container [2018-11-23 10:25:03,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:25:03,065 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:25:03,299 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:03,317 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:25:03,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:03,381 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:25:03,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03 WrapperNode [2018-11-23 10:25:03,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:03,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:03,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:25:03,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:25:03,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:03,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:25:03,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:25:03,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:25:03,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... [2018-11-23 10:25:03,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:25:03,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:25:03,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:25:03,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:25:03,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:25:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:25:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:25:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:25:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:25:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:25:03,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:25:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:25:03,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:25:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:25:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:25:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2018-11-23 10:25:03,634 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2018-11-23 10:25:04,380 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:25:04,381 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:25:04,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:04 BoogieIcfgContainer [2018-11-23 10:25:04,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:25:04,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:25:04,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:25:04,386 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:25:04,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:25:03" (1/3) ... [2018-11-23 10:25:04,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191d921d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:04, skipping insertion in model container [2018-11-23 10:25:04,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:03" (2/3) ... [2018-11-23 10:25:04,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191d921d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:04, skipping insertion in model container [2018-11-23 10:25:04,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:04" (3/3) ... [2018-11-23 10:25:04,391 INFO L112 eAbstractionObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2018-11-23 10:25:04,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:25:04,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:25:04,430 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:25:04,464 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:25:04,465 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:25:04,465 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:25:04,465 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:25:04,466 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:25:04,466 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:25:04,466 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:25:04,466 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:25:04,466 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:25:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 10:25:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:25:04,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:04,497 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:04,499 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:04,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1691531413, now seen corresponding path program 1 times [2018-11-23 10:25:04,515 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:04,516 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:04,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:04,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:05,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 10:25:05,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {35#true} is VALID [2018-11-23 10:25:05,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 10:25:05,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #65#return; {35#true} is VALID [2018-11-23 10:25:05,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret13 := main(); {35#true} is VALID [2018-11-23 10:25:05,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2018-11-23 10:25:05,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {58#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:05,017 INFO L256 TraceCheckUtils]: 7: Hoare triple {58#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {58#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:05,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {65#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:05,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {65#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {36#false} is VALID [2018-11-23 10:25:05,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} #res := ~ret~0[32:0]; {36#false} is VALID [2018-11-23 10:25:05,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-23 10:25:05,020 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {36#false} {58#(bvsgt ~N~0 (_ bv1 32))} #69#return; {36#false} is VALID [2018-11-23 10:25:05,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {36#false} is VALID [2018-11-23 10:25:05,021 INFO L256 TraceCheckUtils]: 14: Hoare triple {36#false} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {36#false} is VALID [2018-11-23 10:25:05,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {36#false} is VALID [2018-11-23 10:25:05,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume !~bvslt32(~i~0, ~N~0); {36#false} is VALID [2018-11-23 10:25:05,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#false} #res := ~ret~0[32:0]; {36#false} is VALID [2018-11-23 10:25:05,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-23 10:25:05,023 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {36#false} {36#false} #71#return; {36#false} is VALID [2018-11-23 10:25:05,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {36#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {36#false} is VALID [2018-11-23 10:25:05,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {36#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {36#false} is VALID [2018-11-23 10:25:05,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {36#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {36#false} is VALID [2018-11-23 10:25:05,024 INFO L256 TraceCheckUtils]: 23: Hoare triple {36#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {36#false} is VALID [2018-11-23 10:25:05,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {36#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {36#false} is VALID [2018-11-23 10:25:05,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {36#false} assume !~bvslt32(~i~0, ~N~0); {36#false} is VALID [2018-11-23 10:25:05,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {36#false} #res := ~ret~0[32:0]; {36#false} is VALID [2018-11-23 10:25:05,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-23 10:25:05,026 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {36#false} {36#false} #73#return; {36#false} is VALID [2018-11-23 10:25:05,026 INFO L273 TraceCheckUtils]: 29: Hoare triple {36#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {36#false} is VALID [2018-11-23 10:25:05,027 INFO L273 TraceCheckUtils]: 30: Hoare triple {36#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36#false} is VALID [2018-11-23 10:25:05,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 10:25:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:25:05,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:05,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:05,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:25:05,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:25:05,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:05,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:25:05,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:05,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:25:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:25:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:25:05,203 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-11-23 10:25:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:06,172 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2018-11-23 10:25:06,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:25:06,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:25:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:25:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 10:25:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:25:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 10:25:06,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2018-11-23 10:25:06,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:06,678 INFO L225 Difference]: With dead ends: 64 [2018-11-23 10:25:06,679 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:25:06,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:25:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:25:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 10:25:06,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:06,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 10:25:06,792 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 10:25:06,792 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 10:25:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:06,798 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 10:25:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 10:25:06,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:06,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:06,800 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 10:25:06,801 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 10:25:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:06,806 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 10:25:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 10:25:06,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:06,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:06,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:06,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:25:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 10:25:06,814 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 10:25:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:06,814 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 10:25:06,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:25:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:25:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 10:25:06,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:06,817 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:06,817 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:06,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2111009974, now seen corresponding path program 1 times [2018-11-23 10:25:06,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:06,819 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 10:25:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:06,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:07,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2018-11-23 10:25:07,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {310#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {310#true} is VALID [2018-11-23 10:25:07,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 10:25:07,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #65#return; {310#true} is VALID [2018-11-23 10:25:07,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret13 := main(); {310#true} is VALID [2018-11-23 10:25:07,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {310#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {310#true} is VALID [2018-11-23 10:25:07,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {333#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:07,130 INFO L256 TraceCheckUtils]: 7: Hoare triple {333#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {333#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:07,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {333#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {340#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:07,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {340#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {340#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:07,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {340#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {340#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:07,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {340#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {350#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:07,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {350#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {311#false} is VALID [2018-11-23 10:25:07,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {311#false} #res := ~ret~0[32:0]; {311#false} is VALID [2018-11-23 10:25:07,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {311#false} assume true; {311#false} is VALID [2018-11-23 10:25:07,137 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {311#false} {333#(bvsgt ~N~0 (_ bv1 32))} #69#return; {311#false} is VALID [2018-11-23 10:25:07,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {311#false} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {311#false} is VALID [2018-11-23 10:25:07,138 INFO L256 TraceCheckUtils]: 17: Hoare triple {311#false} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {311#false} is VALID [2018-11-23 10:25:07,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {311#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {311#false} is VALID [2018-11-23 10:25:07,139 INFO L273 TraceCheckUtils]: 19: Hoare triple {311#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {311#false} is VALID [2018-11-23 10:25:07,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {311#false} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {311#false} is VALID [2018-11-23 10:25:07,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {311#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {311#false} is VALID [2018-11-23 10:25:07,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {311#false} assume !~bvslt32(~i~0, ~N~0); {311#false} is VALID [2018-11-23 10:25:07,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {311#false} #res := ~ret~0[32:0]; {311#false} is VALID [2018-11-23 10:25:07,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {311#false} assume true; {311#false} is VALID [2018-11-23 10:25:07,141 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {311#false} {311#false} #71#return; {311#false} is VALID [2018-11-23 10:25:07,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {311#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {311#false} is VALID [2018-11-23 10:25:07,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {311#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {311#false} is VALID [2018-11-23 10:25:07,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {311#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {311#false} is VALID [2018-11-23 10:25:07,142 INFO L256 TraceCheckUtils]: 29: Hoare triple {311#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {311#false} is VALID [2018-11-23 10:25:07,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {311#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {311#false} is VALID [2018-11-23 10:25:07,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {311#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {311#false} is VALID [2018-11-23 10:25:07,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {311#false} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {311#false} is VALID [2018-11-23 10:25:07,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {311#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {311#false} is VALID [2018-11-23 10:25:07,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {311#false} assume !~bvslt32(~i~0, ~N~0); {311#false} is VALID [2018-11-23 10:25:07,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {311#false} #res := ~ret~0[32:0]; {311#false} is VALID [2018-11-23 10:25:07,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {311#false} assume true; {311#false} is VALID [2018-11-23 10:25:07,145 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {311#false} {311#false} #73#return; {311#false} is VALID [2018-11-23 10:25:07,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {311#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {311#false} is VALID [2018-11-23 10:25:07,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {311#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {311#false} is VALID [2018-11-23 10:25:07,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {311#false} assume !false; {311#false} is VALID [2018-11-23 10:25:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 10:25:07,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:07,572 INFO L273 TraceCheckUtils]: 40: Hoare triple {311#false} assume !false; {311#false} is VALID [2018-11-23 10:25:07,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {311#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {311#false} is VALID [2018-11-23 10:25:07,572 INFO L273 TraceCheckUtils]: 38: Hoare triple {311#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {311#false} is VALID [2018-11-23 10:25:07,573 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {310#true} {311#false} #73#return; {311#false} is VALID [2018-11-23 10:25:07,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 10:25:07,573 INFO L273 TraceCheckUtils]: 35: Hoare triple {310#true} #res := ~ret~0[32:0]; {310#true} is VALID [2018-11-23 10:25:07,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {310#true} assume !~bvslt32(~i~0, ~N~0); {310#true} is VALID [2018-11-23 10:25:07,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {310#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {310#true} is VALID [2018-11-23 10:25:07,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {310#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {310#true} is VALID [2018-11-23 10:25:07,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {310#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {310#true} is VALID [2018-11-23 10:25:07,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {310#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {310#true} is VALID [2018-11-23 10:25:07,577 INFO L256 TraceCheckUtils]: 29: Hoare triple {311#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {310#true} is VALID [2018-11-23 10:25:07,577 INFO L273 TraceCheckUtils]: 28: Hoare triple {311#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {311#false} is VALID [2018-11-23 10:25:07,577 INFO L273 TraceCheckUtils]: 27: Hoare triple {311#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {311#false} is VALID [2018-11-23 10:25:07,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {311#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {311#false} is VALID [2018-11-23 10:25:07,578 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {310#true} {311#false} #71#return; {311#false} is VALID [2018-11-23 10:25:07,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 10:25:07,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {310#true} #res := ~ret~0[32:0]; {310#true} is VALID [2018-11-23 10:25:07,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {310#true} assume !~bvslt32(~i~0, ~N~0); {310#true} is VALID [2018-11-23 10:25:07,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {310#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {310#true} is VALID [2018-11-23 10:25:07,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {310#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {310#true} is VALID [2018-11-23 10:25:07,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {310#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {310#true} is VALID [2018-11-23 10:25:07,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {310#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {310#true} is VALID [2018-11-23 10:25:07,581 INFO L256 TraceCheckUtils]: 17: Hoare triple {311#false} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {310#true} is VALID [2018-11-23 10:25:07,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {311#false} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {311#false} is VALID [2018-11-23 10:25:07,582 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {516#(not (bvsgt ~N~0 (_ bv1 32)))} {333#(bvsgt ~N~0 (_ bv1 32))} #69#return; {311#false} is VALID [2018-11-23 10:25:07,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {516#(not (bvsgt ~N~0 (_ bv1 32)))} assume true; {516#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:07,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#(not (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {516#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:07,587 INFO L273 TraceCheckUtils]: 12: Hoare triple {526#(or (bvslt sep_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !~bvslt32(~i~0, ~N~0); {516#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:07,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {530#(or (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {526#(or (bvslt sep_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:07,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {530#(or (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {530#(or (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:07,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {530#(or (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {530#(or (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:07,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {310#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {530#(or (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:07,597 INFO L256 TraceCheckUtils]: 7: Hoare triple {333#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {310#true} is VALID [2018-11-23 10:25:07,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {333#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:07,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {310#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {310#true} is VALID [2018-11-23 10:25:07,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret13 := main(); {310#true} is VALID [2018-11-23 10:25:07,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #65#return; {310#true} is VALID [2018-11-23 10:25:07,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 10:25:07,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {310#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {310#true} is VALID [2018-11-23 10:25:07,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2018-11-23 10:25:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 10:25:07,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:07,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 10:25:07,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 10:25:07,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:07,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:25:07,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:07,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:25:07,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:25:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:25:07,751 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 8 states. [2018-11-23 10:25:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,378 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 10:25:08,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:25:08,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-23 10:25:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:25:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 10:25:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:25:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 10:25:08,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-23 10:25:08,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:08,544 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:25:08,544 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 10:25:08,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 10:25:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 10:25:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 10:25:08,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:08,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 10:25:08,577 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 10:25:08,577 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 10:25:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,581 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 10:25:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 10:25:08,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:08,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:08,583 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 10:25:08,583 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 10:25:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,587 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 10:25:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 10:25:08,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:08,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:08,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:08,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:25:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 10:25:08,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 41 [2018-11-23 10:25:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:08,592 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 10:25:08,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:25:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:25:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 10:25:08,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:08,595 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:08,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:08,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1048726581, now seen corresponding path program 2 times [2018-11-23 10:25:08,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:08,597 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 10:25:08,616 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:08,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:25:08,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:08,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:09,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {741#true} call ULTIMATE.init(); {741#true} is VALID [2018-11-23 10:25:09,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {741#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {741#true} is VALID [2018-11-23 10:25:09,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-23 10:25:09,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {741#true} {741#true} #65#return; {741#true} is VALID [2018-11-23 10:25:09,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {741#true} call #t~ret13 := main(); {741#true} is VALID [2018-11-23 10:25:09,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {741#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {741#true} is VALID [2018-11-23 10:25:09,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {741#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {764#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:09,080 INFO L256 TraceCheckUtils]: 7: Hoare triple {764#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {764#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:09,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {764#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {771#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {771#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {771#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {771#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {771#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {771#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {781#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {781#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {781#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {781#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {781#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {781#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {791#(and (= (_ bv2 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {791#(and (= (_ bv2 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,098 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,099 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {764#(bvsgt ~N~0 (_ bv1 32))} #69#return; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,101 INFO L256 TraceCheckUtils]: 20: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,133 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #71#return; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:09,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {847#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-23 10:25:09,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {847#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {742#false} is VALID [2018-11-23 10:25:09,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {742#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {742#false} is VALID [2018-11-23 10:25:09,137 INFO L256 TraceCheckUtils]: 35: Hoare triple {742#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {742#false} is VALID [2018-11-23 10:25:09,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {742#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {742#false} is VALID [2018-11-23 10:25:09,138 INFO L273 TraceCheckUtils]: 37: Hoare triple {742#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {742#false} is VALID [2018-11-23 10:25:09,138 INFO L273 TraceCheckUtils]: 38: Hoare triple {742#false} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {742#false} is VALID [2018-11-23 10:25:09,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {742#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {742#false} is VALID [2018-11-23 10:25:09,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {742#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {742#false} is VALID [2018-11-23 10:25:09,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {742#false} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {742#false} is VALID [2018-11-23 10:25:09,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {742#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {742#false} is VALID [2018-11-23 10:25:09,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {742#false} assume !~bvslt32(~i~0, ~N~0); {742#false} is VALID [2018-11-23 10:25:09,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {742#false} #res := ~ret~0[32:0]; {742#false} is VALID [2018-11-23 10:25:09,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-23 10:25:09,140 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {742#false} {742#false} #73#return; {742#false} is VALID [2018-11-23 10:25:09,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {742#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {742#false} is VALID [2018-11-23 10:25:09,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {742#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {742#false} is VALID [2018-11-23 10:25:09,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {742#false} assume !false; {742#false} is VALID [2018-11-23 10:25:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 10:25:09,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:09,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {742#false} assume !false; {742#false} is VALID [2018-11-23 10:25:09,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {742#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {742#false} is VALID [2018-11-23 10:25:09,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {742#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {742#false} is VALID [2018-11-23 10:25:09,607 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {741#true} {742#false} #73#return; {742#false} is VALID [2018-11-23 10:25:09,607 INFO L273 TraceCheckUtils]: 45: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-23 10:25:09,607 INFO L273 TraceCheckUtils]: 44: Hoare triple {741#true} #res := ~ret~0[32:0]; {741#true} is VALID [2018-11-23 10:25:09,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {741#true} assume !~bvslt32(~i~0, ~N~0); {741#true} is VALID [2018-11-23 10:25:09,608 INFO L273 TraceCheckUtils]: 42: Hoare triple {741#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {741#true} is VALID [2018-11-23 10:25:09,608 INFO L273 TraceCheckUtils]: 41: Hoare triple {741#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {741#true} is VALID [2018-11-23 10:25:09,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {741#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {741#true} is VALID [2018-11-23 10:25:09,608 INFO L273 TraceCheckUtils]: 39: Hoare triple {741#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {741#true} is VALID [2018-11-23 10:25:09,608 INFO L273 TraceCheckUtils]: 38: Hoare triple {741#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {741#true} is VALID [2018-11-23 10:25:09,609 INFO L273 TraceCheckUtils]: 37: Hoare triple {741#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {741#true} is VALID [2018-11-23 10:25:09,609 INFO L273 TraceCheckUtils]: 36: Hoare triple {741#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {741#true} is VALID [2018-11-23 10:25:09,609 INFO L256 TraceCheckUtils]: 35: Hoare triple {742#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {741#true} is VALID [2018-11-23 10:25:09,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {742#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {742#false} is VALID [2018-11-23 10:25:09,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {947#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {742#false} is VALID [2018-11-23 10:25:09,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {947#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:09,614 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {741#true} {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #71#return; {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:09,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-23 10:25:09,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {741#true} #res := ~ret~0[32:0]; {741#true} is VALID [2018-11-23 10:25:09,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {741#true} assume !~bvslt32(~i~0, ~N~0); {741#true} is VALID [2018-11-23 10:25:09,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {741#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {741#true} is VALID [2018-11-23 10:25:09,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {741#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {741#true} is VALID [2018-11-23 10:25:09,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {741#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {741#true} is VALID [2018-11-23 10:25:09,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {741#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {741#true} is VALID [2018-11-23 10:25:09,616 INFO L273 TraceCheckUtils]: 23: Hoare triple {741#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {741#true} is VALID [2018-11-23 10:25:09,616 INFO L273 TraceCheckUtils]: 22: Hoare triple {741#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {741#true} is VALID [2018-11-23 10:25:09,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {741#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {741#true} is VALID [2018-11-23 10:25:09,616 INFO L256 TraceCheckUtils]: 20: Hoare triple {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {741#true} is VALID [2018-11-23 10:25:09,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:09,623 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {741#true} {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #69#return; {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:09,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-23 10:25:09,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {741#true} #res := ~ret~0[32:0]; {741#true} is VALID [2018-11-23 10:25:09,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {741#true} assume !~bvslt32(~i~0, ~N~0); {741#true} is VALID [2018-11-23 10:25:09,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {741#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {741#true} is VALID [2018-11-23 10:25:09,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {741#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {741#true} is VALID [2018-11-23 10:25:09,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {741#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {741#true} is VALID [2018-11-23 10:25:09,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {741#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {741#true} is VALID [2018-11-23 10:25:09,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {741#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {741#true} is VALID [2018-11-23 10:25:09,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {741#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {741#true} is VALID [2018-11-23 10:25:09,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {741#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {741#true} is VALID [2018-11-23 10:25:09,626 INFO L256 TraceCheckUtils]: 7: Hoare triple {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {741#true} is VALID [2018-11-23 10:25:09,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {741#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {951#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:25:09,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {741#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {741#true} is VALID [2018-11-23 10:25:09,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {741#true} call #t~ret13 := main(); {741#true} is VALID [2018-11-23 10:25:09,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {741#true} {741#true} #65#return; {741#true} is VALID [2018-11-23 10:25:09,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-23 10:25:09,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {741#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {741#true} is VALID [2018-11-23 10:25:09,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {741#true} call ULTIMATE.init(); {741#true} is VALID [2018-11-23 10:25:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 10:25:09,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 10:25:09,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 10:25:09,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-23 10:25:09,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:09,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 10:25:09,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:09,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 10:25:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 10:25:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:25:09,815 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 10 states. [2018-11-23 10:25:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:11,284 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-11-23 10:25:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:25:11,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-23 10:25:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:25:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2018-11-23 10:25:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:25:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2018-11-23 10:25:11,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2018-11-23 10:25:11,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:11,528 INFO L225 Difference]: With dead ends: 80 [2018-11-23 10:25:11,528 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 10:25:11,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:25:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 10:25:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-11-23 10:25:11,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:11,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 53 states. [2018-11-23 10:25:11,587 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 53 states. [2018-11-23 10:25:11,587 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 53 states. [2018-11-23 10:25:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:11,593 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 10:25:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 10:25:11,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:11,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:11,595 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 60 states. [2018-11-23 10:25:11,595 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 60 states. [2018-11-23 10:25:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:11,600 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 10:25:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 10:25:11,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:11,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:11,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:11,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 10:25:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2018-11-23 10:25:11,606 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2018-11-23 10:25:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:11,607 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2018-11-23 10:25:11,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 10:25:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2018-11-23 10:25:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 10:25:11,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:11,609 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:11,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:11,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1671851891, now seen corresponding path program 1 times [2018-11-23 10:25:11,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:11,610 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 10:25:11,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:25:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:11,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:12,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 10:25:12,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1365#true} is VALID [2018-11-23 10:25:12,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 10:25:12,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #65#return; {1365#true} is VALID [2018-11-23 10:25:12,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret13 := main(); {1365#true} is VALID [2018-11-23 10:25:12,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {1365#true} is VALID [2018-11-23 10:25:12,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {1365#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1365#true} is VALID [2018-11-23 10:25:12,260 INFO L256 TraceCheckUtils]: 7: Hoare triple {1365#true} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {1365#true} is VALID [2018-11-23 10:25:12,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {1365#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} assume !~bvslt32(~i~0, ~N~0); {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} #res := ~ret~0[32:0]; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} assume true; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,273 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} {1365#true} #69#return; {1428#(= |main_#t~ret5| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {1428#(= |main_#t~ret5| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1432#(= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,279 INFO L256 TraceCheckUtils]: 20: Hoare triple {1432#(= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {1365#true} is VALID [2018-11-23 10:25:12,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {1365#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} assume !~bvslt32(~i~0, ~N~0); {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} #res := ~ret~0[32:0]; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} assume true; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,289 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} {1432#(= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #71#return; {1469#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= |main_#t~ret8| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {1469#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= |main_#t~ret8| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,297 INFO L256 TraceCheckUtils]: 37: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {1365#true} is VALID [2018-11-23 10:25:12,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {1365#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,302 INFO L273 TraceCheckUtils]: 40: Hoare triple {1394#(= ((_ sign_extend 32) (_ bv0 32)) sep_~ret~0)} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,305 INFO L273 TraceCheckUtils]: 41: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {1401#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) sep_~ret~0)} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,308 INFO L273 TraceCheckUtils]: 45: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} assume !~bvslt32(~i~0, ~N~0); {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} is VALID [2018-11-23 10:25:12,309 INFO L273 TraceCheckUtils]: 46: Hoare triple {1411#(= (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)) sep_~ret~0)} #res := ~ret~0[32:0]; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,310 INFO L273 TraceCheckUtils]: 47: Hoare triple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} assume true; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,311 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} #73#return; {1522#(and (= |main_#t~ret12| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,313 INFO L273 TraceCheckUtils]: 49: Hoare triple {1522#(and (= |main_#t~ret12| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} ~ret5~0 := #t~ret12;havoc #t~ret12; {1526#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret5~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {1526#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret5~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1366#false} is VALID [2018-11-23 10:25:12,314 INFO L273 TraceCheckUtils]: 51: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 10:25:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 10:25:12,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:12,841 INFO L273 TraceCheckUtils]: 51: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 10:25:12,842 INFO L273 TraceCheckUtils]: 50: Hoare triple {1536#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1366#false} is VALID [2018-11-23 10:25:12,843 INFO L273 TraceCheckUtils]: 49: Hoare triple {1540#(and (= main_~ret2~0 main_~ret~1) (= |main_#t~ret12| main_~ret~1))} ~ret5~0 := #t~ret12;havoc #t~ret12; {1536#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 10:25:12,853 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} #73#return; {1540#(and (= main_~ret2~0 main_~ret~1) (= |main_#t~ret12| main_~ret~1))} is VALID [2018-11-23 10:25:12,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} assume true; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #res := ~ret~0[32:0]; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume !~bvslt32(~i~0, ~N~0); {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,864 INFO L273 TraceCheckUtils]: 40: Hoare triple {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,864 INFO L273 TraceCheckUtils]: 39: Hoare triple {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} is VALID [2018-11-23 10:25:12,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {1365#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} is VALID [2018-11-23 10:25:12,865 INFO L256 TraceCheckUtils]: 37: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {1365#true} is VALID [2018-11-23 10:25:12,866 INFO L273 TraceCheckUtils]: 36: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,867 INFO L273 TraceCheckUtils]: 35: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,867 INFO L273 TraceCheckUtils]: 34: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {1469#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= |main_#t~ret8| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {1473#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,872 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} {1432#(= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #71#return; {1469#(and (= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))) (= |main_#t~ret8| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64)))))} is VALID [2018-11-23 10:25:12,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} assume true; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #res := ~ret~0[32:0]; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,874 INFO L273 TraceCheckUtils]: 28: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume !~bvslt32(~i~0, ~N~0); {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} is VALID [2018-11-23 10:25:12,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {1365#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} is VALID [2018-11-23 10:25:12,885 INFO L256 TraceCheckUtils]: 20: Hoare triple {1432#(= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {1365#true} is VALID [2018-11-23 10:25:12,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {1428#(= |main_#t~ret5| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1432#(= main_~ret~1 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,887 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} {1365#true} #69#return; {1428#(= |main_#t~ret5| ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} assume true; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #res := ~ret~0[32:0]; {1421#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) |sep_#res|)} is VALID [2018-11-23 10:25:12,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume !~bvslt32(~i~0, ~N~0); {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1553#(= ((_ extract 31 0) sep_~ret~0) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1563#(= ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv1 64))) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))))} is VALID [2018-11-23 10:25:12,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} is VALID [2018-11-23 10:25:12,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {1365#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1573#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv2 64))) ((_ extract 31 0) (bvadd sep_~ret~0 (_ bv2 64))))} is VALID [2018-11-23 10:25:12,899 INFO L256 TraceCheckUtils]: 7: Hoare triple {1365#true} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {1365#true} is VALID [2018-11-23 10:25:12,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {1365#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1365#true} is VALID [2018-11-23 10:25:12,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {1365#true} is VALID [2018-11-23 10:25:12,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret13 := main(); {1365#true} is VALID [2018-11-23 10:25:12,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #65#return; {1365#true} is VALID [2018-11-23 10:25:12,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 10:25:12,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1365#true} is VALID [2018-11-23 10:25:12,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 10:25:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 10:25:12,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:12,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-23 10:25:12,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 10:25:12,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:12,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 10:25:13,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:13,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 10:25:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 10:25:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-23 10:25:13,027 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 17 states. [2018-11-23 10:25:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:15,696 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2018-11-23 10:25:15,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:25:15,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 10:25:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 10:25:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 10:25:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 10:25:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 10:25:15,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2018-11-23 10:25:15,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:15,933 INFO L225 Difference]: With dead ends: 131 [2018-11-23 10:25:15,933 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 10:25:15,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-23 10:25:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 10:25:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-11-23 10:25:16,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:16,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 96 states. [2018-11-23 10:25:16,132 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 96 states. [2018-11-23 10:25:16,133 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 96 states. [2018-11-23 10:25:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:16,145 INFO L93 Difference]: Finished difference Result 127 states and 194 transitions. [2018-11-23 10:25:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2018-11-23 10:25:16,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:16,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:16,148 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 127 states. [2018-11-23 10:25:16,148 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 127 states. [2018-11-23 10:25:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:16,160 INFO L93 Difference]: Finished difference Result 127 states and 194 transitions. [2018-11-23 10:25:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2018-11-23 10:25:16,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:16,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:16,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:16,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:25:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2018-11-23 10:25:16,169 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 52 [2018-11-23 10:25:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:16,170 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2018-11-23 10:25:16,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 10:25:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2018-11-23 10:25:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 10:25:16,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:16,172 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:16,172 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:16,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1943057035, now seen corresponding path program 1 times [2018-11-23 10:25:16,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:16,173 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 10:25:16,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:16,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:16,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-23 10:25:16,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:25:16,573 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 17 treesize of output 26 [2018-11-23 10:25:16,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:25:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-23 10:25:16,599 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:16,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:16,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:16,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:16,629 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2018-11-23 10:25:16,642 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:16,642 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~temp~0]. (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= |#memory_int| (store |v_#memory_int_19| |main_~#x~0.base| (let ((.cse1 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (store (let ((.cse0 (select |v_#memory_int_19| |main_~#x~0.base|))) (store .cse0 |main_~#x~0.offset| (select .cse0 .cse1))) .cse1 main_~temp~0))))) [2018-11-23 10:25:16,642 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32))) [2018-11-23 10:25:16,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 10:25:16,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 10:25:16,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:16,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:16,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:16,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-11-23 10:25:16,945 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:16,945 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|]. (let ((.cse0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|))) (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvsrem .cse0 (_ bv2 32)) (_ bv0 32)) (= main_~temp~0 .cse0))) [2018-11-23 10:25:16,945 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#x~0.offset| (_ bv0 32)) (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32))) [2018-11-23 10:25:17,022 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 16 treesize of output 13 [2018-11-23 10:25:17,029 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 13 treesize of output 12 [2018-11-23 10:25:17,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:17,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:17,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:17,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-23 10:25:17,079 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:17,079 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, ~N~0, main_~temp~0]. (and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (store |v_#memory_int_20| |main_~#x~0.base| (store (select |v_#memory_int_20| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) main_~temp~0)) |#memory_int|)) [2018-11-23 10:25:17,080 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [~N~0]. (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) [2018-11-23 10:25:17,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2018-11-23 10:25:17,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {2259#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {2259#true} is VALID [2018-11-23 10:25:17,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2018-11-23 10:25:17,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #65#return; {2259#true} is VALID [2018-11-23 10:25:17,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret13 := main(); {2259#true} is VALID [2018-11-23 10:25:17,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {2259#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {2259#true} is VALID [2018-11-23 10:25:17,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {2259#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2282#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,835 INFO L256 TraceCheckUtils]: 7: Hoare triple {2282#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {2286#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:25:17,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {2286#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2290#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {2290#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2290#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {2290#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2290#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {2290#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2300#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {2300#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2300#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {2300#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2300#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,844 INFO L273 TraceCheckUtils]: 14: Hoare triple {2300#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2310#(and (= (_ bv2 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {2310#(and (= (_ bv2 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,849 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {2282#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #69#return; {2324#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {2324#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2324#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,851 INFO L256 TraceCheckUtils]: 20: Hoare triple {2324#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {2314#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2334#(and (= (_ bv0 32) sep_~i~0) (not (bvslt (_ bv2 32) ~N~0)) (= sep_~x.base |sep_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:25:17,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {2334#(and (= (_ bv0 32) sep_~i~0) (not (bvslt (_ bv2 32) ~N~0)) (= sep_~x.base |sep_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2338#(and (not (bvslt (_ bv2 32) ~N~0)) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {2338#(and (not (bvslt (_ bv2 32) ~N~0)) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|)) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,863 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2342#(and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} {2324#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #71#return; {2367#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:17,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {2367#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:25:17,880 INFO L273 TraceCheckUtils]: 36: Hoare triple {2371#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {2384#(and (exists ((~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32))))) (= |main_~#x~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:25:17,884 INFO L256 TraceCheckUtils]: 37: Hoare triple {2384#(and (exists ((~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32))))) (= |main_~#x~0.offset| (_ bv0 32)))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {2388#(exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:17,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {2388#(exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32))))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2392#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:25:17,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {2392#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2392#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:25:17,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {2392#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2392#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:25:17,889 INFO L273 TraceCheckUtils]: 41: Hoare triple {2392#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2402#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= (_ bv1 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:25:17,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {2402#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= (_ bv1 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2406#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:25:17,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {2406#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32)))))} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:17,895 INFO L273 TraceCheckUtils]: 44: Hoare triple {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:17,896 INFO L273 TraceCheckUtils]: 45: Hoare triple {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume !~bvslt32(~i~0, ~N~0); {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:17,897 INFO L273 TraceCheckUtils]: 46: Hoare triple {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} #res := ~ret~0[32:0]; {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:17,898 INFO L273 TraceCheckUtils]: 47: Hoare triple {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume true; {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:17,905 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2410#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} {2384#(and (exists ((~N~0 (_ BitVec 32))) (and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32))))) (= |main_~#x~0.offset| (_ bv0 32)))} #73#return; {2260#false} is VALID [2018-11-23 10:25:17,905 INFO L273 TraceCheckUtils]: 49: Hoare triple {2260#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {2260#false} is VALID [2018-11-23 10:25:17,905 INFO L273 TraceCheckUtils]: 50: Hoare triple {2260#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2260#false} is VALID [2018-11-23 10:25:17,905 INFO L273 TraceCheckUtils]: 51: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2018-11-23 10:25:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:25:17,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:24,534 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 19 treesize of output 17 [2018-11-23 10:25:24,574 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 9 treesize of output 5 [2018-11-23 10:25:24,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:24,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:25:24,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:25:24,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 10:25:24,602 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:24,602 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|]. (= (_ bv0 32) (bvsrem (select (store (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) main_~temp~0) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32))) [2018-11-23 10:25:24,602 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) [2018-11-23 10:25:27,328 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 24 treesize of output 20 [2018-11-23 10:25:27,337 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:27,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 20 treesize of output 29 [2018-11-23 10:25:27,360 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:27,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 10:25:27,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:27,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:27,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:27,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:27,371 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:5 [2018-11-23 10:25:27,377 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:27,377 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#x~0.base|, v_main_~temp~0_14]. (or (not (= (bvsrem (select (let ((.cse1 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (store (let ((.cse0 (select |#memory_int| |main_~#x~0.base|))) (store .cse0 |main_~#x~0.offset| (select .cse0 .cse1))) .cse1 v_main_~temp~0_14)) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) [2018-11-23 10:25:27,377 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) [2018-11-23 10:25:27,975 INFO L273 TraceCheckUtils]: 51: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2018-11-23 10:25:27,976 INFO L273 TraceCheckUtils]: 50: Hoare triple {2260#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2260#false} is VALID [2018-11-23 10:25:27,976 INFO L273 TraceCheckUtils]: 49: Hoare triple {2260#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {2260#false} is VALID [2018-11-23 10:25:27,978 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} {2444#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #73#return; {2260#false} is VALID [2018-11-23 10:25:27,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume true; {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:27,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #res := ~ret~0[32:0]; {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:27,979 INFO L273 TraceCheckUtils]: 45: Hoare triple {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:27,981 INFO L273 TraceCheckUtils]: 44: Hoare triple {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:27,982 INFO L273 TraceCheckUtils]: 43: Hoare triple {2464#(or (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {2448#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:27,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {2468#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2464#(or (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:30,002 INFO L273 TraceCheckUtils]: 41: Hoare triple {2472#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2468#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is UNKNOWN [2018-11-23 10:25:30,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {2472#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2472#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:30,003 INFO L273 TraceCheckUtils]: 39: Hoare triple {2472#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2472#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:30,004 INFO L273 TraceCheckUtils]: 38: Hoare triple {2259#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2472#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:25:30,004 INFO L256 TraceCheckUtils]: 37: Hoare triple {2444#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {2259#true} is VALID [2018-11-23 10:25:30,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {2444#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,014 INFO L273 TraceCheckUtils]: 35: Hoare triple {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,016 INFO L273 TraceCheckUtils]: 32: Hoare triple {2498#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {2485#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,018 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} {2502#(or (not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #71#return; {2498#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:30,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} assume true; {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} #res := ~ret~0[32:0]; {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {2531#(or (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32)))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2506#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:30,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {2535#(or (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32)))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2531#(or (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32)))))} is VALID [2018-11-23 10:25:30,025 INFO L273 TraceCheckUtils]: 21: Hoare triple {2259#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2535#(or (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32)))))} is VALID [2018-11-23 10:25:30,026 INFO L256 TraceCheckUtils]: 20: Hoare triple {2502#(or (not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {2259#true} is VALID [2018-11-23 10:25:30,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {2542#(= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2502#(or (not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,029 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {2550#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} {2546#(or (bvslt (_ bv2 32) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #69#return; {2542#(= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))} is VALID [2018-11-23 10:25:30,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {2550#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume true; {2550#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {2550#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #res := ~ret~0[32:0]; {2550#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {2560#(or (bvslt sep_~i~0 ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume !~bvslt32(~i~0, ~N~0); {2550#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,032 INFO L273 TraceCheckUtils]: 14: Hoare triple {2564#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2560#(or (bvslt sep_~i~0 ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {2564#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2564#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {2564#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2564#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {2574#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2564#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {2574#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {2574#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:25:30,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {2574#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2574#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:25:30,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {2259#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {2574#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:25:30,069 INFO L256 TraceCheckUtils]: 7: Hoare triple {2546#(or (bvslt (_ bv2 32) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {2259#true} is VALID [2018-11-23 10:25:30,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {2259#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2546#(or (bvslt (_ bv2 32) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:25:30,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {2259#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {2259#true} is VALID [2018-11-23 10:25:30,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret13 := main(); {2259#true} is VALID [2018-11-23 10:25:30,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #65#return; {2259#true} is VALID [2018-11-23 10:25:30,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2018-11-23 10:25:30,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {2259#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {2259#true} is VALID [2018-11-23 10:25:30,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2018-11-23 10:25:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 67 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 10:25:30,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:30,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-11-23 10:25:30,088 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 52 [2018-11-23 10:25:30,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:30,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 10:25:32,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 92 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:32,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 10:25:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 10:25:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:25:32,420 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand 37 states. [2018-11-23 10:25:45,871 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-11-23 10:25:48,305 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-11-23 10:25:52,768 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-11-23 10:26:04,024 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-23 10:26:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:26:09,850 INFO L93 Difference]: Finished difference Result 247 states and 351 transitions. [2018-11-23 10:26:09,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 10:26:09,851 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 52 [2018-11-23 10:26:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:26:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:26:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 241 transitions. [2018-11-23 10:26:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:26:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 241 transitions. [2018-11-23 10:26:09,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 241 transitions. [2018-11-23 10:26:28,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 232 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2018-11-23 10:26:28,924 INFO L225 Difference]: With dead ends: 247 [2018-11-23 10:26:28,924 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 10:26:28,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1279, Invalid=6377, Unknown=0, NotChecked=0, Total=7656 [2018-11-23 10:26:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 10:26:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 140. [2018-11-23 10:26:29,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:26:29,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 140 states. [2018-11-23 10:26:29,175 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 140 states. [2018-11-23 10:26:29,175 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 140 states. [2018-11-23 10:26:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:26:29,190 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2018-11-23 10:26:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 293 transitions. [2018-11-23 10:26:29,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:26:29,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:26:29,193 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 206 states. [2018-11-23 10:26:29,193 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 206 states. [2018-11-23 10:26:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:26:29,207 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2018-11-23 10:26:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 293 transitions. [2018-11-23 10:26:29,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:26:29,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:26:29,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:26:29,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:26:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 10:26:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2018-11-23 10:26:29,218 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 52 [2018-11-23 10:26:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:26:29,218 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2018-11-23 10:26:29,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 10:26:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2018-11-23 10:26:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 10:26:29,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:26:29,221 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:26:29,221 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:26:29,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:26:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1236912011, now seen corresponding path program 2 times [2018-11-23 10:26:29,222 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:26:29,222 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 10:26:29,248 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:26:29,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:26:29,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:26:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:26:29,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:26:29,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-23 10:26:29,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:26:29,651 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 17 treesize of output 26 [2018-11-23 10:26:29,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:26:29,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-23 10:26:29,669 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:26:29,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:29,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:29,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:29,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2018-11-23 10:26:29,715 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:26:29,715 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, main_~temp~0]. (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= (store |v_#memory_int_28| |main_~#x~0.base| (let ((.cse1 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (store (let ((.cse0 (select |v_#memory_int_28| |main_~#x~0.base|))) (store .cse0 |main_~#x~0.offset| (select .cse0 .cse1))) .cse1 main_~temp~0))) |#memory_int|)) [2018-11-23 10:26:29,716 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32))) [2018-11-23 10:26:30,094 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 18 treesize of output 14 [2018-11-23 10:26:30,099 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 14 treesize of output 6 [2018-11-23 10:26:30,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:26:30,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:30,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:30,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2018-11-23 10:26:30,124 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:26:30,125 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|]. (let ((.cse0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|))) (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (not (= (bvsrem .cse0 (_ bv2 32)) (_ bv0 32))) (bvsgt ~N~0 (_ bv1 32)) (= main_~temp~0 .cse0))) [2018-11-23 10:26:30,125 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))))) [2018-11-23 10:26:30,193 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 16 treesize of output 13 [2018-11-23 10:26:30,202 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 13 treesize of output 12 [2018-11-23 10:26:30,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:26:30,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:30,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:26:30,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-23 10:26:30,261 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:26:30,262 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, ~N~0, main_~temp~0]. (and (= (store |v_#memory_int_29| |main_~#x~0.base| (store (select |v_#memory_int_29| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) main_~temp~0)) |#memory_int|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))))) [2018-11-23 10:26:30,262 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [~N~0]. (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32))) [2018-11-23 10:26:30,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {3640#true} call ULTIMATE.init(); {3640#true} is VALID [2018-11-23 10:26:30,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {3640#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {3640#true} is VALID [2018-11-23 10:26:30,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {3640#true} assume true; {3640#true} is VALID [2018-11-23 10:26:30,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3640#true} {3640#true} #65#return; {3640#true} is VALID [2018-11-23 10:26:30,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {3640#true} call #t~ret13 := main(); {3640#true} is VALID [2018-11-23 10:26:30,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {3640#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {3640#true} is VALID [2018-11-23 10:26:30,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {3640#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3663#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,943 INFO L256 TraceCheckUtils]: 7: Hoare triple {3663#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {3667#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:26:30,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {3667#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3671#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {3671#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3671#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {3671#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3671#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {3671#(and (= (_ bv0 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3681#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {3681#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3681#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {3681#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3681#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {3681#(and (= (_ bv1 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3691#(and (= (_ bv2 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {3691#(and (= (_ bv2 32) sep_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,950 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {3663#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #69#return; {3705#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {3705#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3705#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,952 INFO L256 TraceCheckUtils]: 20: Hoare triple {3705#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {3695#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3715#(and (= (_ bv0 32) sep_~i~0) (not (bvslt (_ bv2 32) ~N~0)) (= sep_~x.base |sep_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:26:30,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {3715#(and (= (_ bv0 32) sep_~i~0) (not (bvslt (_ bv2 32) ~N~0)) (= sep_~x.base |sep_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3719#(and (not (bvslt (_ bv2 32) ~N~0)) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {3719#(and (not (bvslt (_ bv2 32) ~N~0)) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|)) (bvsgt ~N~0 (_ bv1 32)))} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,963 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3723#(and (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {3705#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #71#return; {3748#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:26:30,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {3748#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:30,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:30,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:30,968 INFO L273 TraceCheckUtils]: 35: Hoare triple {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:30,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {3752#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {3765#(and (= |main_~#x~0.offset| (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))))} is VALID [2018-11-23 10:26:30,975 INFO L256 TraceCheckUtils]: 37: Hoare triple {3765#(and (= |main_~#x~0.offset| (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {3769#(exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:26:30,975 INFO L273 TraceCheckUtils]: 38: Hoare triple {3769#(exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32))))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3773#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:26:30,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {3773#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3773#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:26:30,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {3773#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3773#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:26:30,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {3773#(and (= (_ bv0 32) sep_~i~0) (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3783#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (_ bv1 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:26:30,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {3783#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (_ bv1 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3787#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:26:30,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {3787#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32)))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:30,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:30,985 INFO L273 TraceCheckUtils]: 45: Hoare triple {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:30,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #res := ~ret~0[32:0]; {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:30,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume true; {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:30,993 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3791#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_6| (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_6|) (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} {3765#(and (= |main_~#x~0.offset| (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))) (_ bv2 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))))} #73#return; {3641#false} is VALID [2018-11-23 10:26:30,994 INFO L273 TraceCheckUtils]: 49: Hoare triple {3641#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {3641#false} is VALID [2018-11-23 10:26:30,994 INFO L273 TraceCheckUtils]: 50: Hoare triple {3641#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3641#false} is VALID [2018-11-23 10:26:30,994 INFO L273 TraceCheckUtils]: 51: Hoare triple {3641#false} assume !false; {3641#false} is VALID [2018-11-23 10:26:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:26:31,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:26:37,665 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 20 treesize of output 18 [2018-11-23 10:26:37,703 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 16 treesize of output 12 [2018-11-23 10:26:37,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:26:37,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:26:37,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:26:37,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2018-11-23 10:26:37,735 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:26:37,735 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|]. (not (= (_ bv0 32) (bvsrem (select (store (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) main_~temp~0) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)))) [2018-11-23 10:26:37,735 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) [2018-11-23 10:26:40,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 10:26:40,555 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:40,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-23 10:26:40,631 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:26:40,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 10:26:40,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:26:40,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:40,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:40,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:26:40,643 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2018-11-23 10:26:40,648 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:26:40,648 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#x~0.base|, v_main_~temp~0_17]. (or (= (_ bv0 32) (bvsrem (select (let ((.cse1 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (store (let ((.cse0 (select |#memory_int| |main_~#x~0.base|))) (store .cse0 |main_~#x~0.offset| (select .cse0 .cse1))) .cse1 v_main_~temp~0_17)) |main_~#x~0.offset|) (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) [2018-11-23 10:26:40,648 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) [2018-11-23 10:26:41,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {3641#false} assume !false; {3641#false} is VALID [2018-11-23 10:26:41,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {3641#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3641#false} is VALID [2018-11-23 10:26:41,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {3641#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {3641#false} is VALID [2018-11-23 10:26:41,265 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} {3825#(not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #73#return; {3641#false} is VALID [2018-11-23 10:26:41,265 INFO L273 TraceCheckUtils]: 47: Hoare triple {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} assume true; {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:26:41,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #res := ~ret~0[32:0]; {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:26:41,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:26:41,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:26:41,267 INFO L273 TraceCheckUtils]: 43: Hoare triple {3845#(or (not (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3829#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:26:41,267 INFO L273 TraceCheckUtils]: 42: Hoare triple {3849#(or (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32)))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3845#(or (not (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {3853#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3849#(or (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32)))))} is UNKNOWN [2018-11-23 10:26:43,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {3853#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3853#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {3853#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3853#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {3640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3853#(or (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,282 INFO L256 TraceCheckUtils]: 37: Hoare triple {3825#(not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {3640#true} is VALID [2018-11-23 10:26:43,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {3825#(not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:43,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:43,287 INFO L273 TraceCheckUtils]: 33: Hoare triple {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:43,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {3879#(and (not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {3866#(and (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (not (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32)))))} is VALID [2018-11-23 10:26:43,290 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} {3883#(or (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} #71#return; {3879#(and (not (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} assume true; {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} #res := ~ret~0[32:0]; {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {3912#(or (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32))))} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {3887#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {3916#(or (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3912#(or (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32))))} is VALID [2018-11-23 10:26:43,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {3640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3916#(or (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32))))} is VALID [2018-11-23 10:26:43,307 INFO L256 TraceCheckUtils]: 20: Hoare triple {3883#(or (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {3640#true} is VALID [2018-11-23 10:26:43,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {3923#(= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3883#(or (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:26:43,311 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3931#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} {3927#(or (bvslt (_ bv2 32) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #69#return; {3923#(= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))} is VALID [2018-11-23 10:26:43,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {3931#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume true; {3931#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {3931#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #res := ~ret~0[32:0]; {3931#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {3941#(or (bvslt sep_~i~0 ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume !~bvslt32(~i~0, ~N~0); {3931#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {3945#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3941#(or (bvslt sep_~i~0 ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {3945#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3945#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {3945#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3945#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {3955#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3945#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv1 32)) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {3955#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {3955#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:26:43,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {3955#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3955#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:26:43,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {3640#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {3955#(or (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)) (bvslt (bvadd sep_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:26:43,360 INFO L256 TraceCheckUtils]: 7: Hoare triple {3927#(or (bvslt (_ bv2 32) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {3640#true} is VALID [2018-11-23 10:26:43,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {3640#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3927#(or (bvslt (_ bv2 32) ~N~0) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:26:43,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {3640#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {3640#true} is VALID [2018-11-23 10:26:43,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {3640#true} call #t~ret13 := main(); {3640#true} is VALID [2018-11-23 10:26:43,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3640#true} {3640#true} #65#return; {3640#true} is VALID [2018-11-23 10:26:43,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {3640#true} assume true; {3640#true} is VALID [2018-11-23 10:26:43,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {3640#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {3640#true} is VALID [2018-11-23 10:26:43,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {3640#true} call ULTIMATE.init(); {3640#true} is VALID [2018-11-23 10:26:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 67 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 10:26:43,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:26:43,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-11-23 10:26:43,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 52 [2018-11-23 10:26:43,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:26:43,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 10:26:45,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 92 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:26:45,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 10:26:45,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 10:26:45,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:26:45,720 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand 37 states. [2018-11-23 10:27:02,332 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2018-11-23 10:27:08,923 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-11-23 10:27:14,357 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-11-23 10:27:30,723 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-11-23 10:27:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:27:34,226 INFO L93 Difference]: Finished difference Result 285 states and 379 transitions. [2018-11-23 10:27:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 10:27:34,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 52 [2018-11-23 10:27:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:27:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:27:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 231 transitions. [2018-11-23 10:27:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:27:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 231 transitions. [2018-11-23 10:27:34,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 231 transitions. [2018-11-23 10:27:53,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 222 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2018-11-23 10:27:53,334 INFO L225 Difference]: With dead ends: 285 [2018-11-23 10:27:53,334 INFO L226 Difference]: Without dead ends: 216 [2018-11-23 10:27:53,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=1274, Invalid=6377, Unknown=5, NotChecked=0, Total=7656 [2018-11-23 10:27:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-23 10:27:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 153. [2018-11-23 10:27:53,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:27:53,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 153 states. [2018-11-23 10:27:53,667 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 153 states. [2018-11-23 10:27:53,667 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 153 states. [2018-11-23 10:27:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:27:53,679 INFO L93 Difference]: Finished difference Result 216 states and 297 transitions. [2018-11-23 10:27:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 297 transitions. [2018-11-23 10:27:53,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:27:53,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:27:53,682 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 216 states. [2018-11-23 10:27:53,682 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 216 states. [2018-11-23 10:27:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:27:53,694 INFO L93 Difference]: Finished difference Result 216 states and 297 transitions. [2018-11-23 10:27:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 297 transitions. [2018-11-23 10:27:53,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:27:53,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:27:53,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:27:53,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:27:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 10:27:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2018-11-23 10:27:53,704 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 52 [2018-11-23 10:27:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:27:53,704 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2018-11-23 10:27:53,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 10:27:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2018-11-23 10:27:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 10:27:53,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:27:53,706 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:27:53,706 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:27:53,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:27:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash -556853641, now seen corresponding path program 3 times [2018-11-23 10:27:53,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:27:53,707 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 10:27:53,736 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:27:54,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:27:54,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:27:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:27:54,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:27:54,660 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 34 treesize of output 27 [2018-11-23 10:27:54,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:27:54,667 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 27 treesize of output 35 [2018-11-23 10:27:54,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:27:54,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-23 10:27:54,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:27:54,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:27:54,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:27:54,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:27:54,740 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-11-23 10:27:54,755 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:27:54,756 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, main_~temp~0]. (let ((.cse0 (select |v_#memory_int_37| |main_~#x~0.base|)) (.cse2 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (let ((.cse1 (select .cse0 .cse2))) (and (= (store |v_#memory_int_37| |main_~#x~0.base| (store (store .cse0 |main_~#x~0.offset| .cse1) .cse2 main_~temp~0)) |#memory_int|) (= |main_~#x~0.offset| (_ bv0 32)) (= (_ bv0 32) (bvsrem .cse1 (_ bv2 32)))))) [2018-11-23 10:27:54,756 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#x~0.offset| (_ bv0 32)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))) [2018-11-23 10:27:55,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {5107#true} call ULTIMATE.init(); {5107#true} is VALID [2018-11-23 10:27:55,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {5107#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {5107#true} is VALID [2018-11-23 10:27:55,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {5107#true} assume true; {5107#true} is VALID [2018-11-23 10:27:55,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5107#true} {5107#true} #65#return; {5107#true} is VALID [2018-11-23 10:27:55,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {5107#true} call #t~ret13 := main(); {5107#true} is VALID [2018-11-23 10:27:55,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {5107#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {5107#true} is VALID [2018-11-23 10:27:55,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {5107#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5130#(= |main_~#x~0.offset| (_ bv0 32))} is VALID [2018-11-23 10:27:55,077 INFO L256 TraceCheckUtils]: 7: Hoare triple {5130#(= |main_~#x~0.offset| (_ bv0 32))} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {5107#true} is VALID [2018-11-23 10:27:55,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {5107#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {5137#(and (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:27:55,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {5137#(and (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5137#(and (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:27:55,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {5137#(and (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5137#(and (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:27:55,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {5137#(and (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5147#(and (= (_ bv1 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:27:55,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {5147#(and (= (_ bv1 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5151#(= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))))} is VALID [2018-11-23 10:27:55,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {5151#(= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:27:55,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:27:55,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:27:55,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #res := ~ret~0[32:0]; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:27:55,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} assume true; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:27:55,085 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} {5130#(= |main_~#x~0.offset| (_ bv0 32))} #69#return; {5171#(and (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)) (= |main_~#x~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:27:55,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {5171#(and (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)) (= |main_~#x~0.offset| (_ bv0 32)))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {5175#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:27:55,091 INFO L256 TraceCheckUtils]: 20: Hoare triple {5175#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {5179#(exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:27:55,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {5179#(exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {5183#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} is VALID [2018-11-23 10:27:55,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {5183#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (= (_ bv0 32) sep_~i~0) (= sep_~x.base |sep_#in~x.base|) (= sep_~x.offset |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5187#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|)))} is VALID [2018-11-23 10:27:55,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {5187#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (= |sep_#t~mem1| (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|)))} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} assume !~bvslt32(~i~0, ~N~0); {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} #res := ~ret~0[32:0]; {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} assume true; {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:27:55,102 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {5191#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_11| (_ BitVec 32))) (= (bvsrem (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_11|) (_ bv0 32)) (_ bv2 32)) (_ bv0 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) |sep_#in~x.offset|) (_ bv2 32)) (_ bv0 32))))} {5175#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32)))} #71#return; {5108#false} is VALID [2018-11-23 10:27:55,103 INFO L273 TraceCheckUtils]: 32: Hoare triple {5108#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {5108#false} is VALID [2018-11-23 10:27:55,103 INFO L273 TraceCheckUtils]: 33: Hoare triple {5108#false} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {5108#false} is VALID [2018-11-23 10:27:55,103 INFO L273 TraceCheckUtils]: 34: Hoare triple {5108#false} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {5108#false} is VALID [2018-11-23 10:27:55,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {5108#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {5108#false} is VALID [2018-11-23 10:27:55,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {5108#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {5108#false} is VALID [2018-11-23 10:27:55,104 INFO L256 TraceCheckUtils]: 37: Hoare triple {5108#false} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {5108#false} is VALID [2018-11-23 10:27:55,104 INFO L273 TraceCheckUtils]: 38: Hoare triple {5108#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {5108#false} is VALID [2018-11-23 10:27:55,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {5108#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5108#false} is VALID [2018-11-23 10:27:55,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {5108#false} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5108#false} is VALID [2018-11-23 10:27:55,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {5108#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5108#false} is VALID [2018-11-23 10:27:55,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {5108#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5108#false} is VALID [2018-11-23 10:27:55,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {5108#false} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {5108#false} is VALID [2018-11-23 10:27:55,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {5108#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5108#false} is VALID [2018-11-23 10:27:55,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {5108#false} assume !~bvslt32(~i~0, ~N~0); {5108#false} is VALID [2018-11-23 10:27:55,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {5108#false} #res := ~ret~0[32:0]; {5108#false} is VALID [2018-11-23 10:27:55,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {5108#false} assume true; {5108#false} is VALID [2018-11-23 10:27:55,106 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {5108#false} {5108#false} #73#return; {5108#false} is VALID [2018-11-23 10:27:55,106 INFO L273 TraceCheckUtils]: 49: Hoare triple {5108#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {5108#false} is VALID [2018-11-23 10:27:55,106 INFO L273 TraceCheckUtils]: 50: Hoare triple {5108#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5108#false} is VALID [2018-11-23 10:27:55,106 INFO L273 TraceCheckUtils]: 51: Hoare triple {5108#false} assume !false; {5108#false} is VALID [2018-11-23 10:27:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 10:27:55,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:28:01,660 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 19 treesize of output 17 [2018-11-23 10:28:01,696 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 9 treesize of output 5 [2018-11-23 10:28:01,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:01,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:28:01,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:28:01,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 10:28:01,722 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:28:01,723 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|]. (= (_ bv0 32) (bvsrem (select (store (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) main_~temp~0) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32))) [2018-11-23 10:28:01,723 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) [2018-11-23 10:28:06,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2018-11-23 10:28:06,870 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 25 treesize of output 21 [2018-11-23 10:28:06,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:06,909 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:06,910 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:28:06,910 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 10:28:06,914 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:06,942 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 16 treesize of output 10 [2018-11-23 10:28:06,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 10:28:06,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:28:06,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:28:06,974 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:26, output treesize:13 [2018-11-23 10:28:06,983 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:28:06,983 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|]. (or (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32))))) [2018-11-23 10:28:06,984 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= sep_~x.base |sep_#in~x.base|) (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0)) (bvadd |sep_#in~x.offset| (_ bv4 32)))) [2018-11-23 10:28:09,257 INFO L273 TraceCheckUtils]: 51: Hoare triple {5108#false} assume !false; {5108#false} is VALID [2018-11-23 10:28:09,257 INFO L273 TraceCheckUtils]: 50: Hoare triple {5108#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5108#false} is VALID [2018-11-23 10:28:09,257 INFO L273 TraceCheckUtils]: 49: Hoare triple {5108#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {5108#false} is VALID [2018-11-23 10:28:09,260 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} {5285#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #73#return; {5108#false} is VALID [2018-11-23 10:28:09,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume true; {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:09,260 INFO L273 TraceCheckUtils]: 46: Hoare triple {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #res := ~ret~0[32:0]; {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:09,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:09,261 INFO L273 TraceCheckUtils]: 44: Hoare triple {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:09,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {5305#(or (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {5289#(not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:09,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {5309#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5305#(or (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:28:11,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {5313#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5309#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is UNKNOWN [2018-11-23 10:28:11,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {5313#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5313#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:28:11,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {5313#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5313#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:28:11,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {5107#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {5313#(or (= (_ bv0 32) (bvsrem (select (select |#memory_int| sep_~x.base) (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4 32))) (_ bv2 32))) (not (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-23 10:28:11,278 INFO L256 TraceCheckUtils]: 37: Hoare triple {5285#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} call #t~ret12 := sep(~#x~0.base, ~#x~0.offset); {5107#true} is VALID [2018-11-23 10:28:11,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {5326#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {5285#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {5330#(or (and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) (bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32))))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {5326#(and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0)))} is VALID [2018-11-23 10:28:11,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {5334#(or (and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) (bvslt (bvadd main_~i~1 (_ bv1 32)) (bvadd ~N~0 (_ bv4294967295 32))))} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {5330#(or (and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) (bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32))))} is VALID [2018-11-23 10:28:11,287 INFO L273 TraceCheckUtils]: 33: Hoare triple {5338#(and (or (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (forall ((~N~0 (_ BitVec 32))) (or (not (bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~1 (_ bv1 32)) (bvadd ~N~0 (_ bv4294967295 32)))))) (forall ((v_prenex_1 (_ BitVec 32))) (or (not (bvslt main_~i~1 (bvadd v_prenex_1 (_ bv4294967295 32)))) (= (_ bv8 32) (bvmul (_ bv4 32) v_prenex_1)) (bvslt (bvadd main_~i~1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4294967295 32))))))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {5334#(or (and (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (= (_ bv8 32) (bvmul (_ bv4 32) ~N~0))) (bvslt (bvadd main_~i~1 (_ bv1 32)) (bvadd ~N~0 (_ bv4294967295 32))))} is VALID [2018-11-23 10:28:11,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {5342#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {5338#(and (or (= (_ bv0 32) (bvsrem main_~temp~0 (_ bv2 32))) (forall ((~N~0 (_ BitVec 32))) (or (not (bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~1 (_ bv1 32)) (bvadd ~N~0 (_ bv4294967295 32)))))) (forall ((v_prenex_1 (_ BitVec 32))) (or (not (bvslt main_~i~1 (bvadd v_prenex_1 (_ bv4294967295 32)))) (= (_ bv8 32) (bvmul (_ bv4 32) v_prenex_1)) (bvslt (bvadd main_~i~1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4294967295 32))))))} is VALID [2018-11-23 10:28:11,290 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {5107#true} {5342#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))} #71#return; {5342#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {5107#true} assume true; {5107#true} is VALID [2018-11-23 10:28:11,291 INFO L273 TraceCheckUtils]: 29: Hoare triple {5107#true} #res := ~ret~0[32:0]; {5107#true} is VALID [2018-11-23 10:28:11,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {5107#true} assume !~bvslt32(~i~0, ~N~0); {5107#true} is VALID [2018-11-23 10:28:11,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {5107#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5107#true} is VALID [2018-11-23 10:28:11,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {5107#true} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5107#true} is VALID [2018-11-23 10:28:11,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {5107#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5107#true} is VALID [2018-11-23 10:28:11,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {5107#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5107#true} is VALID [2018-11-23 10:28:11,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {5107#true} assume !(0bv32 == ~bvsrem32(#t~mem1, 2bv32));havoc #t~mem1;#t~post3 := ~ret~0;~ret~0 := ~bvsub64(#t~post3, 1bv64);havoc #t~post3; {5107#true} is VALID [2018-11-23 10:28:11,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {5107#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5107#true} is VALID [2018-11-23 10:28:11,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {5107#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {5107#true} is VALID [2018-11-23 10:28:11,293 INFO L256 TraceCheckUtils]: 20: Hoare triple {5342#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))} call #t~ret8 := sep(~#x~0.base, ~#x~0.offset); {5107#true} is VALID [2018-11-23 10:28:11,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {5285#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {5342#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,296 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} {5107#true} #69#return; {5285#(= (bvsrem (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} assume true; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #res := ~ret~0[32:0]; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {5403#(or (not (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5155#(= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 10:28:11,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {5407#(and (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4294967292 32)) |sep_#in~x.offset|) (= sep_~x.base |sep_#in~x.base|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5403#(or (not (= (_ bv0 32) (bvsrem |sep_#t~mem1| (_ bv2 32)))) (= (bvsrem (select (select |#memory_int| |sep_#in~x.base|) (bvadd |sep_#in~x.offset| (_ bv4 32))) (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 10:28:11,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {5411#(and (= sep_~x.base |sep_#in~x.base|) (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0)) |sep_#in~x.offset|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5407#(and (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0) (_ bv4294967292 32)) |sep_#in~x.offset|) (= sep_~x.base |sep_#in~x.base|))} is VALID [2018-11-23 10:28:11,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {5411#(and (= sep_~x.base |sep_#in~x.base|) (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0)) |sep_#in~x.offset|))} assume 0bv32 == ~bvsrem32(#t~mem1, 2bv32);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {5411#(and (= sep_~x.base |sep_#in~x.base|) (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0)) |sep_#in~x.offset|))} is VALID [2018-11-23 10:28:11,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {5411#(and (= sep_~x.base |sep_#in~x.base|) (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0)) |sep_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5411#(and (= sep_~x.base |sep_#in~x.base|) (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0)) |sep_#in~x.offset|))} is VALID [2018-11-23 10:28:11,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {5107#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {5411#(and (= sep_~x.base |sep_#in~x.base|) (= (bvadd sep_~x.offset (bvmul (_ bv4 32) sep_~i~0)) |sep_#in~x.offset|))} is VALID [2018-11-23 10:28:11,458 INFO L256 TraceCheckUtils]: 7: Hoare triple {5107#true} call #t~ret5 := sep(~#x~0.base, ~#x~0.offset); {5107#true} is VALID [2018-11-23 10:28:11,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {5107#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5107#true} is VALID [2018-11-23 10:28:11,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {5107#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {5107#true} is VALID [2018-11-23 10:28:11,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {5107#true} call #t~ret13 := main(); {5107#true} is VALID [2018-11-23 10:28:11,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5107#true} {5107#true} #65#return; {5107#true} is VALID [2018-11-23 10:28:11,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {5107#true} assume true; {5107#true} is VALID [2018-11-23 10:28:11,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {5107#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {5107#true} is VALID [2018-11-23 10:28:11,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {5107#true} call ULTIMATE.init(); {5107#true} is VALID [2018-11-23 10:28:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 48 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 10:28:11,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:28:11,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2018-11-23 10:28:11,467 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-11-23 10:28:11,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:28:11,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 10:28:13,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:28:13,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 10:28:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 10:28:13,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=576, Unknown=1, NotChecked=0, Total=650 [2018-11-23 10:28:13,839 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand 26 states. [2018-11-23 10:28:32,824 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 10:28:35,168 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-11-23 10:28:36,085 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29