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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:37:35,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:37:35,858 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:37:35,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:37:35,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:37:35,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:37:35,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:37:35,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:37:35,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:37:35,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:37:35,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:37:35,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:37:35,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:37:35,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:37:35,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:37:35,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:37:35,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:37:35,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:37:35,888 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:37:35,889 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:37:35,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:37:35,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:37:35,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:37:35,897 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:37:35,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:37:35,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:37:35,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:37:35,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:37:35,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:37:35,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:37:35,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:37:35,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:37:35,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:37:35,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:37:35,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:37:35,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:37:35,912 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-14 16:37:35,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:37:35,940 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:37:35,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:37:35,944 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:37:35,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:37:35,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:37:35,945 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:37:35,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:37:35,946 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:37:35,947 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:37:35,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:37:35,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:37:35,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:37:35,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:37:35,948 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:37:35,948 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:37:35,948 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:37:35,948 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:37:35,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:37:35,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:37:35,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:37:35,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:37:35,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:37:35,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:37:35,949 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:37:35,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:37:35,950 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:37:35,950 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:37:35,950 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:37:35,950 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:37:35,952 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:37:35,952 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:37:36,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:37:36,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:37:36,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:37:36,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:37:36,043 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:37:36,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-14 16:37:36,101 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103db9838/6b7dfa4c3dba408489219fc2f99399d2/FLAGacdb6c58f [2018-11-14 16:37:36,560 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:37:36,561 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-14 16:37:36,568 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103db9838/6b7dfa4c3dba408489219fc2f99399d2/FLAGacdb6c58f [2018-11-14 16:37:36,583 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103db9838/6b7dfa4c3dba408489219fc2f99399d2 [2018-11-14 16:37:36,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:37:36,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:37:36,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:37:36,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:37:36,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:37:36,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:36,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3631e39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36, skipping insertion in model container [2018-11-14 16:37:36,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:36,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:37:36,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:37:36,863 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:37:36,872 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:37:36,909 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:37:36,941 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:37:36,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36 WrapperNode [2018-11-14 16:37:36,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:37:36,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:37:36,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:37:36,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:37:36,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:36,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:36,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:36,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:37,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:37,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:37,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (1/1) ... [2018-11-14 16:37:37,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:37:37,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:37:37,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:37:37,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:37:37,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (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-14 16:37:37,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:37:37,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:37:37,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:37:37,201 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:37:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:37:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:37:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 16:37:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:37:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:37:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:37:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:37:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:37:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:37:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:37:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:37:37,853 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:37:37,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:37:37 BoogieIcfgContainer [2018-11-14 16:37:37,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:37:37,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:37:37,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:37:37,859 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:37:37,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:37:36" (1/3) ... [2018-11-14 16:37:37,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e051ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:37:37, skipping insertion in model container [2018-11-14 16:37:37,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:37:36" (2/3) ... [2018-11-14 16:37:37,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e051ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:37:37, skipping insertion in model container [2018-11-14 16:37:37,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:37:37" (3/3) ... [2018-11-14 16:37:37,863 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-14 16:37:37,873 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:37:37,881 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:37:37,897 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:37:37,937 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:37:37,938 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:37:37,938 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:37:37,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:37:37,938 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:37:37,939 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:37:37,939 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:37:37,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:37:37,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:37:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-14 16:37:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:37:37,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:37:37,964 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:37:37,966 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:37:37,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:37:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash 277130583, now seen corresponding path program 1 times [2018-11-14 16:37:37,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:37:37,977 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-14 16:37:37,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:37:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:38,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:37:38,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-14 16:37:38,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {34#true} is VALID [2018-11-14 16:37:38,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-14 16:37:38,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #72#return; {34#true} is VALID [2018-11-14 16:37:38,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret9 := main(); {34#true} is VALID [2018-11-14 16:37:38,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {34#true} is VALID [2018-11-14 16:37:38,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-14 16:37:38,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} ~k~0 := 1bv32; {35#false} is VALID [2018-11-14 16:37:38,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-14 16:37:38,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {35#false} is VALID [2018-11-14 16:37:38,348 INFO L256 TraceCheckUtils]: 10: Hoare triple {35#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {35#false} is VALID [2018-11-14 16:37:38,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-14 16:37:38,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume ~cond == 0bv32; {35#false} is VALID [2018-11-14 16:37:38,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-14 16:37:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:37:38,352 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:37:38,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:37:38,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:37:38,363 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 16:37:38,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:37:38,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:37:38,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:38,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:37:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:37:38,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:37:38,538 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-14 16:37:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:38,658 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-14 16:37:38,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:37:38,659 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 16:37:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:37:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:37:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 16:37:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:37:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 16:37:38,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-14 16:37:38,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:38,940 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:37:38,940 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 16:37:38,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:37:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 16:37:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 16:37:39,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:37:39,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 16:37:39,007 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:37:39,008 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:37:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:39,014 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 16:37:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:37:39,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:39,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:39,015 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 16:37:39,016 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 16:37:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:39,020 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-14 16:37:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:37:39,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:39,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:39,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:37:39,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:37:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:37:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-14 16:37:39,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 14 [2018-11-14 16:37:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:37:39,027 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-14 16:37:39,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:37:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-14 16:37:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:37:39,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:37:39,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:37:39,029 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:37:39,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:37:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash -32556863, now seen corresponding path program 1 times [2018-11-14 16:37:39,030 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:37:39,031 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-14 16:37:39,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:37:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:39,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:37:39,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2018-11-14 16:37:39,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {234#true} is VALID [2018-11-14 16:37:39,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2018-11-14 16:37:39,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #72#return; {234#true} is VALID [2018-11-14 16:37:39,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret9 := main(); {234#true} is VALID [2018-11-14 16:37:39,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {234#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {254#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:39,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {254#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {254#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:39,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {254#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~j~0, ~SIZE~0); {261#(not (bvult (_ bv1 32) main_~SIZE~0))} is VALID [2018-11-14 16:37:39,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {261#(not (bvult (_ bv1 32) main_~SIZE~0))} ~k~0 := 1bv32; {265#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:37:39,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {265#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {265#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:37:39,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {265#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {235#false} is VALID [2018-11-14 16:37:39,227 INFO L256 TraceCheckUtils]: 11: Hoare triple {235#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {235#false} is VALID [2018-11-14 16:37:39,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2018-11-14 16:37:39,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {235#false} assume ~cond == 0bv32; {235#false} is VALID [2018-11-14 16:37:39,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {235#false} assume !false; {235#false} is VALID [2018-11-14 16:37:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:37:39,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:37:39,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:37:39,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:37:39,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:37:39,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:37:39,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:37:39,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:39,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:37:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:37:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:37:39,397 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-11-14 16:37:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:40,048 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 16:37:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:37:40,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:37:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:37:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:37:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-14 16:37:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:37:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-14 16:37:40,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-14 16:37:40,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:40,175 INFO L225 Difference]: With dead ends: 48 [2018-11-14 16:37:40,175 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:37:40,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:37:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:37:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-14 16:37:40,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:37:40,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-14 16:37:40,192 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-14 16:37:40,193 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-14 16:37:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:40,195 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 16:37:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-14 16:37:40,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:40,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:40,196 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-14 16:37:40,197 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-14 16:37:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:40,200 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 16:37:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-14 16:37:40,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:40,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:40,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:37:40,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:37:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:37:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 16:37:40,204 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-11-14 16:37:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:37:40,204 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 16:37:40,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:37:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:37:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:37:40,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:37:40,206 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:37:40,206 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:37:40,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:37:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash 894306866, now seen corresponding path program 1 times [2018-11-14 16:37:40,208 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:37:40,208 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-14 16:37:40,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:37:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:40,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:37:40,774 INFO L477 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 25 [2018-11-14 16:37:40,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:37:40,855 INFO L477 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 25 treesize of output 24 [2018-11-14 16:37:40,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:37:40,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:37:40,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:37:40,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2018-11-14 16:37:41,124 INFO L477 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 27 treesize of output 19 [2018-11-14 16:37:41,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-14 16:37:41,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:37:41,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:37:41,145 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-14 16:37:41,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:4 [2018-11-14 16:37:41,160 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:37:41,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2018-11-14 16:37:41,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {456#true} is VALID [2018-11-14 16:37:41,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2018-11-14 16:37:41,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #72#return; {456#true} is VALID [2018-11-14 16:37:41,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret9 := main(); {456#true} is VALID [2018-11-14 16:37:41,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {476#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:37:41,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {476#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:37:41,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {476#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {483#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:37:41,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {483#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {483#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:37:41,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {483#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {483#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:37:41,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {483#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {493#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:37:41,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {493#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {497#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-14 16:37:41,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {497#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:37:41,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:37:41,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:37:41,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:37:41,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {501#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {514#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:37:41,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {514#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {514#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:37:41,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {514#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {521#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-14 16:37:41,289 INFO L256 TraceCheckUtils]: 19: Hoare triple {521#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {525#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:41,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {525#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {529#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:41,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {529#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {457#false} is VALID [2018-11-14 16:37:41,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {457#false} assume !false; {457#false} is VALID [2018-11-14 16:37:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:37:41,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:37:42,188 INFO L477 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 65 treesize of output 53 [2018-11-14 16:38:09,157 WARN L179 SmtUtils]: Spent 26.89 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-14 16:38:09,167 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,168 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,168 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,174 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2018-11-14 16:38:09,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:38:09,215 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:38:09,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:38:09,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,259 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,260 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,260 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,261 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:09,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 79 [2018-11-14 16:38:09,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-14 16:38:09,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:38:09,404 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-14 16:38:09,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:8 [2018-11-14 16:38:09,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:38:09,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {457#false} assume !false; {457#false} is VALID [2018-11-14 16:38:09,479 INFO L273 TraceCheckUtils]: 21: Hoare triple {539#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {457#false} is VALID [2018-11-14 16:38:09,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {543#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {539#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:38:09,489 INFO L256 TraceCheckUtils]: 19: Hoare triple {521#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {543#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:38:09,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {550#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {521#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-14 16:38:09,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {550#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} assume true; {550#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} is VALID [2018-11-14 16:38:09,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} ~k~0 := 1bv32; {550#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} is VALID [2018-11-14 16:38:09,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume !~bvult32(~j~0, ~SIZE~0); {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 16:38:09,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume true; {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 16:38:09,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 16:38:09,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {570#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {557#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 16:38:09,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {570#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 16:38:09,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {578#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {574#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} is VALID [2018-11-14 16:38:09,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {578#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~short4 := ~bvsge32(~i~0, 0bv32); {578#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:09,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {578#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {578#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:11,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {588#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {578#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is UNKNOWN [2018-11-14 16:38:11,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {588#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume true; {588#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-14 16:38:11,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {588#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-14 16:38:11,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret9 := main(); {456#true} is VALID [2018-11-14 16:38:11,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #72#return; {456#true} is VALID [2018-11-14 16:38:11,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2018-11-14 16:38:11,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {456#true} is VALID [2018-11-14 16:38:11,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2018-11-14 16:38:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:38:11,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:38:11,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-14 16:38:11,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-14 16:38:11,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:38:11,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:38:13,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 16:38:14,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:38:14,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:38:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:38:14,001 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 19 states. [2018-11-14 16:38:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:20,340 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2018-11-14 16:38:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:38:20,341 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-14 16:38:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:38:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:38:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 124 transitions. [2018-11-14 16:38:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:38:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 124 transitions. [2018-11-14 16:38:20,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 124 transitions. [2018-11-14 16:38:22,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:38:22,137 INFO L225 Difference]: With dead ends: 103 [2018-11-14 16:38:22,138 INFO L226 Difference]: Without dead ends: 83 [2018-11-14 16:38:22,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:38:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-14 16:38:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2018-11-14 16:38:22,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:38:22,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 49 states. [2018-11-14 16:38:22,218 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 49 states. [2018-11-14 16:38:22,218 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 49 states. [2018-11-14 16:38:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:22,226 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-11-14 16:38:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-14 16:38:22,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:38:22,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:38:22,228 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 83 states. [2018-11-14 16:38:22,228 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 83 states. [2018-11-14 16:38:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:22,234 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-11-14 16:38:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-14 16:38:22,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:38:22,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:38:22,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:38:22,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:38:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:38:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-14 16:38:22,240 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 23 [2018-11-14 16:38:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:38:22,240 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-14 16:38:22,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:38:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 16:38:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:38:22,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:38:22,242 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:38:22,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:38:22,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:38:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1150796076, now seen corresponding path program 1 times [2018-11-14 16:38:22,244 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:38:22,244 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-14 16:38:22,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:38:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:38:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:38:22,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:38:22,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {1000#true} call ULTIMATE.init(); {1000#true} is VALID [2018-11-14 16:38:22,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {1000#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1000#true} is VALID [2018-11-14 16:38:22,778 INFO L273 TraceCheckUtils]: 2: Hoare triple {1000#true} assume true; {1000#true} is VALID [2018-11-14 16:38:22,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} #72#return; {1000#true} is VALID [2018-11-14 16:38:22,779 INFO L256 TraceCheckUtils]: 4: Hoare triple {1000#true} call #t~ret9 := main(); {1000#true} is VALID [2018-11-14 16:38:22,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {1000#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1020#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:22,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {1020#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1020#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:22,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {1020#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {1027#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1046#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:22,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {1046#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} assume true; {1046#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:22,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {1046#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {1053#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} is VALID [2018-11-14 16:38:22,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {1053#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} ~k~0 := 1bv32; {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,792 INFO L256 TraceCheckUtils]: 19: Hoare triple {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1000#true} is VALID [2018-11-14 16:38:22,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {1000#true} ~cond := #in~cond; {1000#true} is VALID [2018-11-14 16:38:22,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {1000#true} assume !(~cond == 0bv32); {1000#true} is VALID [2018-11-14 16:38:22,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {1000#true} assume true; {1000#true} is VALID [2018-11-14 16:38:22,795 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1000#true} {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #76#return; {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem7;havoc #t~mem8; {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:22,797 INFO L273 TraceCheckUtils]: 25: Hoare triple {1057#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1085#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-14 16:38:22,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {1085#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} assume true; {1085#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-14 16:38:22,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {1085#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1001#false} is VALID [2018-11-14 16:38:22,801 INFO L256 TraceCheckUtils]: 28: Hoare triple {1001#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1001#false} is VALID [2018-11-14 16:38:22,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {1001#false} ~cond := #in~cond; {1001#false} is VALID [2018-11-14 16:38:22,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {1001#false} assume ~cond == 0bv32; {1001#false} is VALID [2018-11-14 16:38:22,802 INFO L273 TraceCheckUtils]: 31: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2018-11-14 16:38:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:38:22,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:38:23,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2018-11-14 16:38:23,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {1001#false} assume ~cond == 0bv32; {1001#false} is VALID [2018-11-14 16:38:23,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {1001#false} ~cond := #in~cond; {1001#false} is VALID [2018-11-14 16:38:23,142 INFO L256 TraceCheckUtils]: 28: Hoare triple {1001#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1001#false} is VALID [2018-11-14 16:38:23,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {1116#(not (bvult main_~k~0 main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1001#false} is VALID [2018-11-14 16:38:23,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {1116#(not (bvult main_~k~0 main_~SIZE~0))} assume true; {1116#(not (bvult main_~k~0 main_~SIZE~0))} is VALID [2018-11-14 16:38:23,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1116#(not (bvult main_~k~0 main_~SIZE~0))} is VALID [2018-11-14 16:38:23,144 INFO L273 TraceCheckUtils]: 24: Hoare triple {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} havoc #t~mem7;havoc #t~mem8; {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,144 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1000#true} {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #76#return; {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {1000#true} assume true; {1000#true} is VALID [2018-11-14 16:38:23,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {1000#true} assume !(~cond == 0bv32); {1000#true} is VALID [2018-11-14 16:38:23,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {1000#true} ~cond := #in~cond; {1000#true} is VALID [2018-11-14 16:38:23,146 INFO L256 TraceCheckUtils]: 19: Hoare triple {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1000#true} is VALID [2018-11-14 16:38:23,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} assume true; {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {1151#(not (bvult (_ bv2 32) main_~SIZE~0))} ~k~0 := 1bv32; {1123#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {1155#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {1151#(not (bvult (_ bv2 32) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {1155#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} assume true; {1155#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} is VALID [2018-11-14 16:38:23,165 INFO L273 TraceCheckUtils]: 13: Hoare triple {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1155#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} is VALID [2018-11-14 16:38:23,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume true; {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {1181#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1162#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-14 16:38:23,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {1181#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} assume true; {1181#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} is VALID [2018-11-14 16:38:23,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {1000#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1181#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} is VALID [2018-11-14 16:38:23,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {1000#true} call #t~ret9 := main(); {1000#true} is VALID [2018-11-14 16:38:23,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} #72#return; {1000#true} is VALID [2018-11-14 16:38:23,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {1000#true} assume true; {1000#true} is VALID [2018-11-14 16:38:23,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {1000#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1000#true} is VALID [2018-11-14 16:38:23,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {1000#true} call ULTIMATE.init(); {1000#true} is VALID [2018-11-14 16:38:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:38:23,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:38:23,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 16:38:23,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-14 16:38:23,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:38:23,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:38:23,450 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-14 16:38:23,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:38:23,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:38:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:38:23,452 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 14 states. [2018-11-14 16:38:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:24,843 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2018-11-14 16:38:24,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:38:24,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-14 16:38:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:38:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:38:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-14 16:38:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:38:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2018-11-14 16:38:24,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2018-11-14 16:38:24,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:38:24,965 INFO L225 Difference]: With dead ends: 100 [2018-11-14 16:38:24,965 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 16:38:24,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:38:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 16:38:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2018-11-14 16:38:25,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:38:25,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 69 states. [2018-11-14 16:38:25,020 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 69 states. [2018-11-14 16:38:25,020 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 69 states. [2018-11-14 16:38:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:25,024 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-11-14 16:38:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2018-11-14 16:38:25,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:38:25,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:38:25,026 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 81 states. [2018-11-14 16:38:25,026 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 81 states. [2018-11-14 16:38:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:25,031 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-11-14 16:38:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2018-11-14 16:38:25,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:38:25,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:38:25,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:38:25,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:38:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 16:38:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-11-14 16:38:25,036 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 32 [2018-11-14 16:38:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:38:25,036 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-11-14 16:38:25,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:38:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2018-11-14 16:38:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:38:25,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:38:25,038 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:38:25,038 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:38:25,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:38:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 480109918, now seen corresponding path program 1 times [2018-11-14 16:38:25,039 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:38:25,039 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-14 16:38:25,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:38:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:38:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:38:25,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:38:25,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {1594#true} call ULTIMATE.init(); {1594#true} is VALID [2018-11-14 16:38:25,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {1594#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1594#true} is VALID [2018-11-14 16:38:25,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {1594#true} assume true; {1594#true} is VALID [2018-11-14 16:38:25,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1594#true} {1594#true} #72#return; {1594#true} is VALID [2018-11-14 16:38:25,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {1594#true} call #t~ret9 := main(); {1594#true} is VALID [2018-11-14 16:38:25,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {1594#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1614#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:25,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {1614#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1614#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:25,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {1614#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1621#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:38:25,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {1621#(= main_~i~0 (_ bv0 32))} assume true; {1621#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:38:25,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {1621#(= main_~i~0 (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1621#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:38:25,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {1621#(= main_~i~0 (_ bv0 32))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1621#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:38:25,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {1621#(= main_~i~0 (_ bv0 32))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {1634#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:25,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {1634#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {1634#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:25,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {1634#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1641#(not |main_#t~short4|)} is VALID [2018-11-14 16:38:25,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {1641#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1595#false} is VALID [2018-11-14 16:38:25,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {1595#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {1595#false} is VALID [2018-11-14 16:38:25,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {1595#false} assume true; {1595#false} is VALID [2018-11-14 16:38:25,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {1595#false} #t~short4 := ~bvsge32(~i~0, 0bv32); {1595#false} is VALID [2018-11-14 16:38:25,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {1595#false} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1595#false} is VALID [2018-11-14 16:38:25,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {1595#false} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1595#false} is VALID [2018-11-14 16:38:25,216 INFO L273 TraceCheckUtils]: 20: Hoare triple {1595#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1595#false} is VALID [2018-11-14 16:38:25,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {1595#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1595#false} is VALID [2018-11-14 16:38:25,217 INFO L273 TraceCheckUtils]: 22: Hoare triple {1595#false} assume true; {1595#false} is VALID [2018-11-14 16:38:25,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {1595#false} assume !~bvult32(~j~0, ~SIZE~0); {1595#false} is VALID [2018-11-14 16:38:25,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {1595#false} ~k~0 := 1bv32; {1595#false} is VALID [2018-11-14 16:38:25,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {1595#false} assume true; {1595#false} is VALID [2018-11-14 16:38:25,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {1595#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1595#false} is VALID [2018-11-14 16:38:25,218 INFO L256 TraceCheckUtils]: 27: Hoare triple {1595#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1595#false} is VALID [2018-11-14 16:38:25,218 INFO L273 TraceCheckUtils]: 28: Hoare triple {1595#false} ~cond := #in~cond; {1595#false} is VALID [2018-11-14 16:38:25,218 INFO L273 TraceCheckUtils]: 29: Hoare triple {1595#false} assume ~cond == 0bv32; {1595#false} is VALID [2018-11-14 16:38:25,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {1595#false} assume !false; {1595#false} is VALID [2018-11-14 16:38:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 16:38:25,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:38:25,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {1595#false} assume !false; {1595#false} is VALID [2018-11-14 16:38:25,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {1595#false} assume ~cond == 0bv32; {1595#false} is VALID [2018-11-14 16:38:25,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {1595#false} ~cond := #in~cond; {1595#false} is VALID [2018-11-14 16:38:25,303 INFO L256 TraceCheckUtils]: 27: Hoare triple {1595#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1595#false} is VALID [2018-11-14 16:38:25,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {1595#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1595#false} is VALID [2018-11-14 16:38:25,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {1595#false} assume true; {1595#false} is VALID [2018-11-14 16:38:25,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {1595#false} ~k~0 := 1bv32; {1595#false} is VALID [2018-11-14 16:38:25,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {1595#false} assume !~bvult32(~j~0, ~SIZE~0); {1595#false} is VALID [2018-11-14 16:38:25,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {1595#false} assume true; {1595#false} is VALID [2018-11-14 16:38:25,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {1595#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1595#false} is VALID [2018-11-14 16:38:25,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {1595#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1595#false} is VALID [2018-11-14 16:38:25,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {1595#false} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1595#false} is VALID [2018-11-14 16:38:25,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {1595#false} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1595#false} is VALID [2018-11-14 16:38:25,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {1595#false} #t~short4 := ~bvsge32(~i~0, 0bv32); {1595#false} is VALID [2018-11-14 16:38:25,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {1595#false} assume true; {1595#false} is VALID [2018-11-14 16:38:25,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {1595#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {1595#false} is VALID [2018-11-14 16:38:25,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {1641#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1595#false} is VALID [2018-11-14 16:38:25,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {1744#(not (bvsge main_~i~0 (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1641#(not |main_#t~short4|)} is VALID [2018-11-14 16:38:25,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {1744#(not (bvsge main_~i~0 (_ bv0 32)))} assume true; {1744#(not (bvsge main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:38:25,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {1744#(not (bvsge main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:38:25,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:25,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:25,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:25,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {1764#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1751#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:25,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {1764#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1764#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:25,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {1594#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1764#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:25,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {1594#true} call #t~ret9 := main(); {1594#true} is VALID [2018-11-14 16:38:25,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1594#true} {1594#true} #72#return; {1594#true} is VALID [2018-11-14 16:38:25,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {1594#true} assume true; {1594#true} is VALID [2018-11-14 16:38:25,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {1594#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1594#true} is VALID [2018-11-14 16:38:25,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {1594#true} call ULTIMATE.init(); {1594#true} is VALID [2018-11-14 16:38:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 16:38:25,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:38:25,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 16:38:25,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 16:38:25,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:38:25,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:38:25,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:38:25,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:38:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:38:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:38:25,386 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 9 states. [2018-11-14 16:38:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:26,052 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2018-11-14 16:38:26,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:38:26,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 16:38:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:38:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:38:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-14 16:38:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:38:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2018-11-14 16:38:26,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 77 transitions. [2018-11-14 16:38:26,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:38:26,199 INFO L225 Difference]: With dead ends: 116 [2018-11-14 16:38:26,199 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 16:38:26,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:38:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 16:38:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-11-14 16:38:26,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:38:26,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 58 states. [2018-11-14 16:38:26,370 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 58 states. [2018-11-14 16:38:26,370 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 58 states. [2018-11-14 16:38:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:26,374 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 16:38:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-14 16:38:26,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:38:26,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:38:26,377 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 63 states. [2018-11-14 16:38:26,377 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 63 states. [2018-11-14 16:38:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:38:26,384 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 16:38:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-14 16:38:26,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:38:26,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:38:26,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:38:26,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:38:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:38:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-14 16:38:26,388 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 31 [2018-11-14 16:38:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:38:26,388 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-14 16:38:26,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:38:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-14 16:38:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:38:26,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:38:26,389 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:38:26,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:38:26,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:38:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash -693836487, now seen corresponding path program 2 times [2018-11-14 16:38:26,391 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:38:26,391 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-14 16:38:26,420 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:38:26,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:38:26,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:38:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:38:26,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:38:26,636 INFO L477 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 15 treesize of output 12 [2018-11-14 16:38:26,640 INFO L477 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 12 treesize of output 11 [2018-11-14 16:38:26,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:38:26,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:38:26,661 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-14 16:38:26,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-14 16:38:26,672 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:38:26,884 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-14 16:38:26,942 INFO L477 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 35 treesize of output 28 [2018-11-14 16:38:27,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:38:27,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:27,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 43 [2018-11-14 16:38:27,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:38:27,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:38:27,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:38:27,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:31 [2018-11-14 16:38:27,069 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:38:27,453 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-14 16:38:27,581 INFO L477 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 37 treesize of output 28 [2018-11-14 16:38:27,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:38:27,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:38:27,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:38:27,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-14 16:38:27,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:38:27,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:38:27,649 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-14 16:38:27,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2018-11-14 16:38:27,664 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:38:27,869 INFO L477 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 34 treesize of output 24 [2018-11-14 16:38:27,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-11-14 16:38:27,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:38:27,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:38:27,898 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-14 16:38:27,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:8 [2018-11-14 16:38:27,908 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:38:28,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {2148#true} call ULTIMATE.init(); {2148#true} is VALID [2018-11-14 16:38:28,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {2148#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2148#true} is VALID [2018-11-14 16:38:28,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {2148#true} assume true; {2148#true} is VALID [2018-11-14 16:38:28,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2148#true} {2148#true} #72#return; {2148#true} is VALID [2018-11-14 16:38:28,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {2148#true} call #t~ret9 := main(); {2148#true} is VALID [2018-11-14 16:38:28,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {2148#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {2168#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {2168#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {2168#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {2168#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {2175#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2168#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {2168#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2194#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {2194#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {2194#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {2194#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {2201#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:28,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {2201#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2201#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:28,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {2201#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2201#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:38:28,072 INFO L273 TraceCheckUtils]: 18: Hoare triple {2201#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2211#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:38:28,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {2211#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {2215#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {2215#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume true; {2215#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {2215#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {2215#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:38:28,103 INFO L273 TraceCheckUtils]: 22: Hoare triple {2215#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {2225#(or (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))) (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))))} is VALID [2018-11-14 16:38:28,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {2225#(or (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))) (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {2229#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-14 16:38:28,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {2229#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:28,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:28,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:28,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:28,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {2233#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {2246#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:28,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {2246#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume true; {2246#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 16:38:28,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {2246#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {2253#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} is VALID [2018-11-14 16:38:28,166 INFO L256 TraceCheckUtils]: 31: Hoare triple {2253#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {2257#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:28,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {2257#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2261#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:38:28,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {2261#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {2149#false} is VALID [2018-11-14 16:38:28,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {2149#false} assume !false; {2149#false} is VALID [2018-11-14 16:38:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:38:28,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:38:32,057 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-14 16:38:34,602 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-14 16:38:35,206 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-14 16:38:35,310 INFO L477 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 208 treesize of output 188 [2018-11-14 16:38:36,619 WARN L179 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-11-14 16:38:36,638 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:36,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:37,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 301 treesize of output 267 [2018-11-14 16:38:40,049 WARN L179 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-11-14 16:38:40,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:40,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:40,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:40,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:38:40,212 INFO L303 Elim1Store]: Index analysis took 157 ms [2018-11-14 16:38:41,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 167 [2018-11-14 16:39:23,833 WARN L179 SmtUtils]: Spent 42.55 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-14 16:39:23,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:23,868 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:23,896 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:23,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 43 [2018-11-14 16:39:23,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:39:23,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:39:23,932 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:23,938 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:23,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-11-14 16:39:23,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:39:23,983 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:24,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:24,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 50 [2018-11-14 16:39:24,061 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-14 16:39:24,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:39:24,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-14 16:39:24,137 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:39:24,144 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:39:24,145 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:39:24,163 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:24,169 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:24,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:24,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 47 [2018-11-14 16:39:24,211 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 16:39:24,250 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:24,275 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:39:24,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-11-14 16:39:24,331 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.