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-Const.epf -i ../../../trunk/examples/svcomp/array-crafted/bor2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:58:16,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:58:16,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:58:16,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:58:16,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:58:16,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:58:16,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:58:16,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:58:16,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:58:16,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:58:16,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:58:16,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:58:16,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:58:16,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:58:16,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:58:16,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:58:16,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:58:16,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:58:16,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:58:16,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:58:16,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:58:16,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:58:16,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:58:16,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:58:16,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:58:16,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:58:16,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:58:16,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:58:16,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:58:16,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:58:16,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:58:16,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:58:16,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:58:16,930 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:58:16,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:58:16,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:58:16,932 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:58:16,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:58:16,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:58:16,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:58:16,949 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:58:16,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:58:16,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:58:16,950 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:58:16,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:58:16,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:58:16,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:58:16,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:58:16,951 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:58:16,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:58:16,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:58:16,951 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:58:16,951 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:58:16,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:58:16,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:58:16,952 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:58:16,952 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:58:16,953 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:58:16,953 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:58:16,953 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:58:16,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:58:16,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:58:16,954 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:58:16,954 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:58:16,954 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:58:16,954 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:58:16,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:58:16,955 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:58:16,955 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:58:16,955 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:58:16,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:58:17,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:58:17,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:58:17,018 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:58:17,019 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:58:17,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bor2_true-unreach-call.i [2018-11-14 17:58:17,078 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed15e20f2/81e0dcebe334485fab1231452814b1c1/FLAG61072ba83 [2018-11-14 17:58:17,529 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:58:17,530 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor2_true-unreach-call.i [2018-11-14 17:58:17,536 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed15e20f2/81e0dcebe334485fab1231452814b1c1/FLAG61072ba83 [2018-11-14 17:58:17,553 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed15e20f2/81e0dcebe334485fab1231452814b1c1 [2018-11-14 17:58:17,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:58:17,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:58:17,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:58:17,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:58:17,575 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:58:17,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:17,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d6ddf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17, skipping insertion in model container [2018-11-14 17:58:17,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:17,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:58:17,620 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:58:17,920 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:58:17,936 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:58:17,970 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:58:17,990 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:58:17,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17 WrapperNode [2018-11-14 17:58:17,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:58:17,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:58:17,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:58:17,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:58:18,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:18,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:18,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:18,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:18,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:18,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:18,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (1/1) ... [2018-11-14 17:58:18,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:58:18,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:58:18,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:58:18,055 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:58:18,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (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 17:58:18,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:58:18,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:58:18,190 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2018-11-14 17:58:18,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:58:18,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:58:18,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:58:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2018-11-14 17:58:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:58:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:58:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:58:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:58:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:58:18,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:58:18,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:58:18,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:58:18,892 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:58:18,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:58:18 BoogieIcfgContainer [2018-11-14 17:58:18,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:58:18,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:58:18,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:58:18,898 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:58:18,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:58:17" (1/3) ... [2018-11-14 17:58:18,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfc2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:58:18, skipping insertion in model container [2018-11-14 17:58:18,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:58:17" (2/3) ... [2018-11-14 17:58:18,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfc2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:58:18, skipping insertion in model container [2018-11-14 17:58:18,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:58:18" (3/3) ... [2018-11-14 17:58:18,902 INFO L112 eAbstractionObserver]: Analyzing ICFG bor2_true-unreach-call.i [2018-11-14 17:58:18,912 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:58:18,921 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:58:18,939 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:58:18,976 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:58:18,977 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:58:18,978 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:58:18,978 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:58:18,978 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:58:18,980 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:58:18,980 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:58:18,980 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:58:18,981 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:58:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:58:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:58:19,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:19,022 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:19,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:19,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1401494287, now seen corresponding path program 1 times [2018-11-14 17:58:19,038 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:19,038 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 17:58:19,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:58:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:19,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:19,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:58:19,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {37#true} is VALID [2018-11-14 17:58:19,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:58:19,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:58:19,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-14 17:58:19,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {37#true} is VALID [2018-11-14 17:58:19,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:58:19,419 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:58:19,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {38#false} is VALID [2018-11-14 17:58:19,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:58:19,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} #res := ~res~0[32:0]; {38#false} is VALID [2018-11-14 17:58:19,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:58:19,421 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:58:19,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {38#false} is VALID [2018-11-14 17:58:19,422 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:58:19,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {38#false} is VALID [2018-11-14 17:58:19,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:58:19,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} #res := ~res~0[32:0]; {38#false} is VALID [2018-11-14 17:58:19,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:58:19,423 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:58:19,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {38#false} is VALID [2018-11-14 17:58:19,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:58:19,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {38#false} is VALID [2018-11-14 17:58:19,425 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:58:19,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {38#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {38#false} is VALID [2018-11-14 17:58:19,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:58:19,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {38#false} #res := ~res~0[32:0]; {38#false} is VALID [2018-11-14 17:58:19,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:58:19,427 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {38#false} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:58:19,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {38#false} is VALID [2018-11-14 17:58:19,427 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {38#false} is VALID [2018-11-14 17:58:19,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:58:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:58:19,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:58:19,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:58:19,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:58:19,455 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:58:19,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:19,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:58:19,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:19,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:58:19,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:58:19,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:58:19,652 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:58:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:19,870 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:58:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:58:19,871 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:58:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:58:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:58:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:58:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:58:19,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:58:20,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:20,099 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:58:20,099 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:58:20,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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 17:58:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:58:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:58:20,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:20,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:58:20,283 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:58:20,284 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:58:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:20,294 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:58:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:58:20,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:20,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:20,300 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:58:20,300 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:58:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:20,310 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:58:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:58:20,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:20,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:20,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:20,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:58:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:58:20,320 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:58:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:20,321 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:58:20,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:58:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:58:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:58:20,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:20,324 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:20,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:20,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:20,325 INFO L82 PathProgramCache]: Analyzing trace with hash -741637549, now seen corresponding path program 1 times [2018-11-14 17:58:20,326 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:20,326 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 17:58:20,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:58:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:20,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:20,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2018-11-14 17:58:20,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {308#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {308#true} is VALID [2018-11-14 17:58:20,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2018-11-14 17:58:20,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #69#return; {308#true} is VALID [2018-11-14 17:58:20,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret13 := main(); {308#true} is VALID [2018-11-14 17:58:20,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {308#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {328#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:20,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {328#(= main_~i~1 (_ bv0 32))} assume true; {328#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:20,795 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(= main_~i~1 (_ bv0 32))} assume !~bvslt32(~i~1, 1000bv32); {309#false} is VALID [2018-11-14 17:58:20,795 INFO L256 TraceCheckUtils]: 8: Hoare triple {309#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:58:20,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {309#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {309#false} is VALID [2018-11-14 17:58:20,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:58:20,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#false} assume !~bvslt32(~i~0, 1000bv32); {309#false} is VALID [2018-11-14 17:58:20,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#false} #res := ~res~0[32:0]; {309#false} is VALID [2018-11-14 17:58:20,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:58:20,798 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {309#false} {309#false} #73#return; {309#false} is VALID [2018-11-14 17:58:20,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {309#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {309#false} is VALID [2018-11-14 17:58:20,798 INFO L256 TraceCheckUtils]: 16: Hoare triple {309#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:58:20,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {309#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {309#false} is VALID [2018-11-14 17:58:20,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:58:20,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {309#false} assume !~bvslt32(~i~0, 1000bv32); {309#false} is VALID [2018-11-14 17:58:20,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {309#false} #res := ~res~0[32:0]; {309#false} is VALID [2018-11-14 17:58:20,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:58:20,800 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {309#false} {309#false} #75#return; {309#false} is VALID [2018-11-14 17:58:20,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {309#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {309#false} is VALID [2018-11-14 17:58:20,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:58:20,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {309#false} assume !~bvslt32(~i~2, 999bv32); {309#false} is VALID [2018-11-14 17:58:20,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {309#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {309#false} is VALID [2018-11-14 17:58:20,802 INFO L256 TraceCheckUtils]: 27: Hoare triple {309#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:58:20,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {309#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {309#false} is VALID [2018-11-14 17:58:20,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:58:20,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {309#false} assume !~bvslt32(~i~0, 1000bv32); {309#false} is VALID [2018-11-14 17:58:20,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {309#false} #res := ~res~0[32:0]; {309#false} is VALID [2018-11-14 17:58:20,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:58:20,804 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {309#false} {309#false} #77#return; {309#false} is VALID [2018-11-14 17:58:20,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {309#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {309#false} is VALID [2018-11-14 17:58:20,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {309#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {309#false} is VALID [2018-11-14 17:58:20,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {309#false} assume !false; {309#false} is VALID [2018-11-14 17:58:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:58:20,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:58:20,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:58:20,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:58:20,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:58:20,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:20,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:58:20,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:20,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:58:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:58:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:58:20,902 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:58:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:21,119 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:58:21,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:58:21,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:58:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:58:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:58:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:58:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:58:21,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:58:21,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:21,334 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:58:21,334 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:58:21,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:58:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:58:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:58:21,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:21,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:58:21,352 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:58:21,352 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:58:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:21,357 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:58:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:58:21,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:21,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:21,359 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:58:21,359 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:58:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:21,363 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:58:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:58:21,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:21,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:21,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:21,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:58:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:58:21,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:58:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:21,368 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:58:21,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:58:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:58:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:58:21,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:21,371 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:21,371 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:21,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 989317657, now seen corresponding path program 1 times [2018-11-14 17:58:21,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:21,377 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 17:58:21,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:58:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:21,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:21,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-14 17:58:21,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {598#true} is VALID [2018-11-14 17:58:21,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #69#return; {598#true} is VALID [2018-11-14 17:58:21,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret13 := main(); {598#true} is VALID [2018-11-14 17:58:21,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:21,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {618#(= main_~i~1 (_ bv0 32))} assume true; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:21,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {618#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:21,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {618#(= main_~i~1 (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:21,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:21,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 1000bv32); {599#false} is VALID [2018-11-14 17:58:21,696 INFO L256 TraceCheckUtils]: 11: Hoare triple {599#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:58:21,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {599#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {599#false} is VALID [2018-11-14 17:58:21,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {599#false} assume !~bvslt32(~i~0, 1000bv32); {599#false} is VALID [2018-11-14 17:58:21,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {599#false} #res := ~res~0[32:0]; {599#false} is VALID [2018-11-14 17:58:21,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,697 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {599#false} {599#false} #73#return; {599#false} is VALID [2018-11-14 17:58:21,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:58:21,698 INFO L256 TraceCheckUtils]: 19: Hoare triple {599#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:58:21,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {599#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {599#false} is VALID [2018-11-14 17:58:21,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {599#false} assume !~bvslt32(~i~0, 1000bv32); {599#false} is VALID [2018-11-14 17:58:21,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {599#false} #res := ~res~0[32:0]; {599#false} is VALID [2018-11-14 17:58:21,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,700 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {599#false} {599#false} #75#return; {599#false} is VALID [2018-11-14 17:58:21,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {599#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {599#false} is VALID [2018-11-14 17:58:21,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {599#false} assume !~bvslt32(~i~2, 999bv32); {599#false} is VALID [2018-11-14 17:58:21,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {599#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:58:21,701 INFO L256 TraceCheckUtils]: 30: Hoare triple {599#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:58:21,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {599#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {599#false} is VALID [2018-11-14 17:58:21,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {599#false} assume !~bvslt32(~i~0, 1000bv32); {599#false} is VALID [2018-11-14 17:58:21,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {599#false} #res := ~res~0[32:0]; {599#false} is VALID [2018-11-14 17:58:21,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,703 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {599#false} {599#false} #77#return; {599#false} is VALID [2018-11-14 17:58:21,703 INFO L273 TraceCheckUtils]: 37: Hoare triple {599#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {599#false} is VALID [2018-11-14 17:58:21,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {599#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {599#false} is VALID [2018-11-14 17:58:21,704 INFO L273 TraceCheckUtils]: 39: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-14 17:58:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:58:21,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:58:21,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-14 17:58:21,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {599#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {599#false} is VALID [2018-11-14 17:58:21,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {599#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {599#false} is VALID [2018-11-14 17:58:21,883 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {598#true} {599#false} #77#return; {599#false} is VALID [2018-11-14 17:58:21,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {598#true} #res := ~res~0[32:0]; {598#true} is VALID [2018-11-14 17:58:21,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {598#true} assume !~bvslt32(~i~0, 1000bv32); {598#true} is VALID [2018-11-14 17:58:21,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {598#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {598#true} is VALID [2018-11-14 17:58:21,885 INFO L256 TraceCheckUtils]: 30: Hoare triple {599#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:58:21,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {599#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:58:21,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {599#false} assume !~bvslt32(~i~2, 999bv32); {599#false} is VALID [2018-11-14 17:58:21,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:58:21,886 INFO L273 TraceCheckUtils]: 26: Hoare triple {599#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {599#false} is VALID [2018-11-14 17:58:21,886 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {598#true} {599#false} #75#return; {599#false} is VALID [2018-11-14 17:58:21,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {598#true} #res := ~res~0[32:0]; {598#true} is VALID [2018-11-14 17:58:21,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {598#true} assume !~bvslt32(~i~0, 1000bv32); {598#true} is VALID [2018-11-14 17:58:21,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {598#true} is VALID [2018-11-14 17:58:21,888 INFO L256 TraceCheckUtils]: 19: Hoare triple {599#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:58:21,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:58:21,889 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {598#true} {599#false} #73#return; {599#false} is VALID [2018-11-14 17:58:21,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {598#true} #res := ~res~0[32:0]; {598#true} is VALID [2018-11-14 17:58:21,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {598#true} assume !~bvslt32(~i~0, 1000bv32); {598#true} is VALID [2018-11-14 17:58:21,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {598#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {598#true} is VALID [2018-11-14 17:58:21,890 INFO L256 TraceCheckUtils]: 11: Hoare triple {599#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:58:21,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#(bvslt main_~i~1 (_ bv1000 32))} assume !~bvslt32(~i~1, 1000bv32); {599#false} is VALID [2018-11-14 17:58:21,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {809#(bvslt main_~i~1 (_ bv1000 32))} assume true; {809#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:21,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {809#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:21,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:21,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume true; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:21,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:21,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret13 := main(); {598#true} is VALID [2018-11-14 17:58:21,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #69#return; {598#true} is VALID [2018-11-14 17:58:21,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:58:21,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {598#true} is VALID [2018-11-14 17:58:21,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-14 17:58:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:58:21,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:58:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:58:21,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:58:21,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:21,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:58:22,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:22,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:58:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:58:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:58:22,022 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-14 17:58:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:22,334 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 17:58:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:58:22,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:58:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:58:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:58:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:58:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:58:22,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2018-11-14 17:58:22,459 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 17:58:22,460 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:58:22,461 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:58:22,461 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:58:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:58:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:58:22,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:22,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:58:22,475 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:58:22,475 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:58:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:22,479 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:58:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:58:22,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:22,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:22,480 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:58:22,480 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:58:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:22,484 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:58:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:58:22,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:22,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:22,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:22,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:58:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-14 17:58:22,488 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 40 [2018-11-14 17:58:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:22,489 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-14 17:58:22,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:58:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:58:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:58:22,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:22,491 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:22,491 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:22,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash -384166189, now seen corresponding path program 2 times [2018-11-14 17:58:22,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:22,492 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 17:58:22,514 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:58:22,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:58:22,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:58:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:22,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:22,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2018-11-14 17:58:22,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {1061#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1061#true} is VALID [2018-11-14 17:58:22,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #69#return; {1061#true} is VALID [2018-11-14 17:58:22,664 INFO L256 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret13 := main(); {1061#true} is VALID [2018-11-14 17:58:22,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1061#true} is VALID [2018-11-14 17:58:22,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1061#true} is VALID [2018-11-14 17:58:22,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1061#true} is VALID [2018-11-14 17:58:22,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1061#true} is VALID [2018-11-14 17:58:22,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {1061#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1061#true} is VALID [2018-11-14 17:58:22,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1061#true} is VALID [2018-11-14 17:58:22,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {1061#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1061#true} is VALID [2018-11-14 17:58:22,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1061#true} is VALID [2018-11-14 17:58:22,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {1061#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1061#true} is VALID [2018-11-14 17:58:22,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,667 INFO L273 TraceCheckUtils]: 19: Hoare triple {1061#true} assume !~bvslt32(~i~1, 1000bv32); {1061#true} is VALID [2018-11-14 17:58:22,667 INFO L256 TraceCheckUtils]: 20: Hoare triple {1061#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:58:22,668 INFO L273 TraceCheckUtils]: 21: Hoare triple {1061#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1061#true} is VALID [2018-11-14 17:58:22,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {1061#true} assume !~bvslt32(~i~0, 1000bv32); {1061#true} is VALID [2018-11-14 17:58:22,668 INFO L273 TraceCheckUtils]: 24: Hoare triple {1061#true} #res := ~res~0[32:0]; {1061#true} is VALID [2018-11-14 17:58:22,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,669 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1061#true} {1061#true} #73#return; {1061#true} is VALID [2018-11-14 17:58:22,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {1061#true} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1061#true} is VALID [2018-11-14 17:58:22,669 INFO L256 TraceCheckUtils]: 28: Hoare triple {1061#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:58:22,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {1061#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1061#true} is VALID [2018-11-14 17:58:22,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {1061#true} assume !~bvslt32(~i~0, 1000bv32); {1061#true} is VALID [2018-11-14 17:58:22,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {1061#true} #res := ~res~0[32:0]; {1061#true} is VALID [2018-11-14 17:58:22,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,671 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1061#true} {1061#true} #75#return; {1061#true} is VALID [2018-11-14 17:58:22,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {1061#true} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {1061#true} is VALID [2018-11-14 17:58:22,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:58:22,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {1061#true} assume !~bvslt32(~i~2, 999bv32); {1061#true} is VALID [2018-11-14 17:58:22,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {1061#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {1061#true} is VALID [2018-11-14 17:58:22,672 INFO L256 TraceCheckUtils]: 39: Hoare triple {1061#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:58:22,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {1061#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1186#(= (_ bv1 32) bor_~i~0)} is VALID [2018-11-14 17:58:22,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {1186#(= (_ bv1 32) bor_~i~0)} assume true; {1186#(= (_ bv1 32) bor_~i~0)} is VALID [2018-11-14 17:58:22,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {1186#(= (_ bv1 32) bor_~i~0)} assume !~bvslt32(~i~0, 1000bv32); {1062#false} is VALID [2018-11-14 17:58:22,674 INFO L273 TraceCheckUtils]: 43: Hoare triple {1062#false} #res := ~res~0[32:0]; {1062#false} is VALID [2018-11-14 17:58:22,674 INFO L273 TraceCheckUtils]: 44: Hoare triple {1062#false} assume true; {1062#false} is VALID [2018-11-14 17:58:22,674 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1062#false} {1061#true} #77#return; {1062#false} is VALID [2018-11-14 17:58:22,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {1062#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {1062#false} is VALID [2018-11-14 17:58:22,675 INFO L273 TraceCheckUtils]: 47: Hoare triple {1062#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1062#false} is VALID [2018-11-14 17:58:22,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2018-11-14 17:58:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-14 17:58:22,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:58:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:58:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:58:22,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:58:22,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:22,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:58:22,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:22,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:58:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:58:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:58:22,746 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2018-11-14 17:58:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:22,887 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-14 17:58:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:58:22,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:58:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:58:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:58:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:58:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:58:22,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:58:23,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:23,095 INFO L225 Difference]: With dead ends: 62 [2018-11-14 17:58:23,095 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:58:23,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:58:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:58:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-14 17:58:23,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:23,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-14 17:58:23,131 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-14 17:58:23,131 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-14 17:58:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:23,134 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-14 17:58:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 17:58:23,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:23,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:23,135 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-14 17:58:23,135 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-14 17:58:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:23,138 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-14 17:58:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 17:58:23,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:23,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:23,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:23,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:58:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-14 17:58:23,142 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 49 [2018-11-14 17:58:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:23,143 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-14 17:58:23,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:58:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:58:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:58:23,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:23,145 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:23,145 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:23,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1791434779, now seen corresponding path program 1 times [2018-11-14 17:58:23,146 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:23,146 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 17:58:23,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:58:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:23,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:23,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2018-11-14 17:58:23,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {1437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1437#true} is VALID [2018-11-14 17:58:23,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1437#true} #69#return; {1437#true} is VALID [2018-11-14 17:58:23,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {1437#true} call #t~ret13 := main(); {1437#true} is VALID [2018-11-14 17:58:23,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {1437#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:23,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} assume true; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:23,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:23,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:23,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 1000bv32); {1438#false} is VALID [2018-11-14 17:58:23,428 INFO L256 TraceCheckUtils]: 20: Hoare triple {1438#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:58:23,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {1438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1438#false} is VALID [2018-11-14 17:58:23,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {1438#false} is VALID [2018-11-14 17:58:23,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {1438#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1438#false} is VALID [2018-11-14 17:58:23,429 INFO L273 TraceCheckUtils]: 25: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {1438#false} assume !~bvslt32(~i~0, 1000bv32); {1438#false} is VALID [2018-11-14 17:58:23,430 INFO L273 TraceCheckUtils]: 27: Hoare triple {1438#false} #res := ~res~0[32:0]; {1438#false} is VALID [2018-11-14 17:58:23,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,430 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1438#false} {1438#false} #73#return; {1438#false} is VALID [2018-11-14 17:58:23,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {1438#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:58:23,431 INFO L256 TraceCheckUtils]: 31: Hoare triple {1438#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:58:23,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {1438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1438#false} is VALID [2018-11-14 17:58:23,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {1438#false} is VALID [2018-11-14 17:58:23,432 INFO L273 TraceCheckUtils]: 35: Hoare triple {1438#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1438#false} is VALID [2018-11-14 17:58:23,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,433 INFO L273 TraceCheckUtils]: 37: Hoare triple {1438#false} assume !~bvslt32(~i~0, 1000bv32); {1438#false} is VALID [2018-11-14 17:58:23,433 INFO L273 TraceCheckUtils]: 38: Hoare triple {1438#false} #res := ~res~0[32:0]; {1438#false} is VALID [2018-11-14 17:58:23,433 INFO L273 TraceCheckUtils]: 39: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,433 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1438#false} {1438#false} #75#return; {1438#false} is VALID [2018-11-14 17:58:23,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {1438#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {1438#false} is VALID [2018-11-14 17:58:23,434 INFO L273 TraceCheckUtils]: 42: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,434 INFO L273 TraceCheckUtils]: 43: Hoare triple {1438#false} assume !~bvslt32(~i~2, 999bv32); {1438#false} is VALID [2018-11-14 17:58:23,434 INFO L273 TraceCheckUtils]: 44: Hoare triple {1438#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:58:23,434 INFO L256 TraceCheckUtils]: 45: Hoare triple {1438#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:58:23,435 INFO L273 TraceCheckUtils]: 46: Hoare triple {1438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1438#false} is VALID [2018-11-14 17:58:23,435 INFO L273 TraceCheckUtils]: 47: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,435 INFO L273 TraceCheckUtils]: 48: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {1438#false} is VALID [2018-11-14 17:58:23,435 INFO L273 TraceCheckUtils]: 49: Hoare triple {1438#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1438#false} is VALID [2018-11-14 17:58:23,435 INFO L273 TraceCheckUtils]: 50: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,435 INFO L273 TraceCheckUtils]: 51: Hoare triple {1438#false} assume !~bvslt32(~i~0, 1000bv32); {1438#false} is VALID [2018-11-14 17:58:23,436 INFO L273 TraceCheckUtils]: 52: Hoare triple {1438#false} #res := ~res~0[32:0]; {1438#false} is VALID [2018-11-14 17:58:23,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,436 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1438#false} {1438#false} #77#return; {1438#false} is VALID [2018-11-14 17:58:23,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {1438#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {1438#false} is VALID [2018-11-14 17:58:23,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {1438#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1438#false} is VALID [2018-11-14 17:58:23,437 INFO L273 TraceCheckUtils]: 57: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2018-11-14 17:58:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:58:23,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:58:23,795 INFO L273 TraceCheckUtils]: 57: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2018-11-14 17:58:23,796 INFO L273 TraceCheckUtils]: 56: Hoare triple {1438#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1438#false} is VALID [2018-11-14 17:58:23,797 INFO L273 TraceCheckUtils]: 55: Hoare triple {1438#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {1438#false} is VALID [2018-11-14 17:58:23,797 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1437#true} {1438#false} #77#return; {1438#false} is VALID [2018-11-14 17:58:23,798 INFO L273 TraceCheckUtils]: 53: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,798 INFO L273 TraceCheckUtils]: 52: Hoare triple {1437#true} #res := ~res~0[32:0]; {1437#true} is VALID [2018-11-14 17:58:23,798 INFO L273 TraceCheckUtils]: 51: Hoare triple {1437#true} assume !~bvslt32(~i~0, 1000bv32); {1437#true} is VALID [2018-11-14 17:58:23,799 INFO L273 TraceCheckUtils]: 50: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,799 INFO L273 TraceCheckUtils]: 49: Hoare triple {1437#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1437#true} is VALID [2018-11-14 17:58:23,799 INFO L273 TraceCheckUtils]: 48: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {1437#true} is VALID [2018-11-14 17:58:23,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,800 INFO L273 TraceCheckUtils]: 46: Hoare triple {1437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1437#true} is VALID [2018-11-14 17:58:23,800 INFO L256 TraceCheckUtils]: 45: Hoare triple {1438#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:58:23,800 INFO L273 TraceCheckUtils]: 44: Hoare triple {1438#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:58:23,800 INFO L273 TraceCheckUtils]: 43: Hoare triple {1438#false} assume !~bvslt32(~i~2, 999bv32); {1438#false} is VALID [2018-11-14 17:58:23,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:58:23,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {1438#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {1438#false} is VALID [2018-11-14 17:58:23,801 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1437#true} {1438#false} #75#return; {1438#false} is VALID [2018-11-14 17:58:23,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {1437#true} #res := ~res~0[32:0]; {1437#true} is VALID [2018-11-14 17:58:23,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {1437#true} assume !~bvslt32(~i~0, 1000bv32); {1437#true} is VALID [2018-11-14 17:58:23,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {1437#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1437#true} is VALID [2018-11-14 17:58:23,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {1437#true} is VALID [2018-11-14 17:58:23,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {1437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1437#true} is VALID [2018-11-14 17:58:23,804 INFO L256 TraceCheckUtils]: 31: Hoare triple {1438#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:58:23,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {1438#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:58:23,804 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1437#true} {1438#false} #73#return; {1438#false} is VALID [2018-11-14 17:58:23,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {1437#true} #res := ~res~0[32:0]; {1437#true} is VALID [2018-11-14 17:58:23,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {1437#true} assume !~bvslt32(~i~0, 1000bv32); {1437#true} is VALID [2018-11-14 17:58:23,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {1437#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1437#true} is VALID [2018-11-14 17:58:23,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {1437#true} is VALID [2018-11-14 17:58:23,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {1437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {1437#true} is VALID [2018-11-14 17:58:23,807 INFO L256 TraceCheckUtils]: 20: Hoare triple {1438#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:58:23,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {1732#(bvslt main_~i~1 (_ bv1000 32))} assume !~bvslt32(~i~1, 1000bv32); {1438#false} is VALID [2018-11-14 17:58:23,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {1732#(bvslt main_~i~1 (_ bv1000 32))} assume true; {1732#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:23,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1732#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:23,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume true; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} assume true; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} assume true; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} assume true; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {1437#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:23,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {1437#true} call #t~ret13 := main(); {1437#true} is VALID [2018-11-14 17:58:23,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1437#true} #69#return; {1437#true} is VALID [2018-11-14 17:58:23,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:58:23,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {1437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1437#true} is VALID [2018-11-14 17:58:23,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2018-11-14 17:58:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:58:23,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:58:23,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:58:23,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-14 17:58:23,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:23,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:58:24,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:24,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:58:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:58:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:58:24,003 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-11-14 17:58:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:24,984 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-14 17:58:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:58:24,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-14 17:58:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:58:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-14 17:58:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:58:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-14 17:58:24,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 91 transitions. [2018-11-14 17:58:25,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:25,192 INFO L225 Difference]: With dead ends: 82 [2018-11-14 17:58:25,193 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:58:25,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:58:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:58:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 17:58:25,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:25,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 17:58:25,219 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 17:58:25,219 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 17:58:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:25,222 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 17:58:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:58:25,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:25,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:25,223 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 17:58:25,224 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 17:58:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:25,227 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 17:58:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:58:25,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:25,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:25,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:25,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 17:58:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-14 17:58:25,231 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 58 [2018-11-14 17:58:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:25,232 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-14 17:58:25,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:58:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:58:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 17:58:25,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:25,234 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:25,234 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:25,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1415102757, now seen corresponding path program 2 times [2018-11-14 17:58:25,235 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:25,235 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 17:58:25,256 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:58:25,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:58:25,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:58:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:25,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:25,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2117#true} is VALID [2018-11-14 17:58:25,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {2117#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2117#true} is VALID [2018-11-14 17:58:25,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:25,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #69#return; {2117#true} is VALID [2018-11-14 17:58:25,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret13 := main(); {2117#true} is VALID [2018-11-14 17:58:25,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {2117#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:25,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} assume true; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:25,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:25,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:58:25,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} assume true; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:58:25,690 INFO L273 TraceCheckUtils]: 22: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:58:25,691 INFO L273 TraceCheckUtils]: 23: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,691 INFO L273 TraceCheckUtils]: 24: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume true; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,692 INFO L273 TraceCheckUtils]: 25: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:58:25,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} assume true; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:58:25,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:58:25,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,765 INFO L273 TraceCheckUtils]: 32: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:58:25,765 INFO L273 TraceCheckUtils]: 33: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} assume true; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:58:25,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:58:25,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,769 INFO L273 TraceCheckUtils]: 36: Hoare triple {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:25,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 1000bv32); {2118#false} is VALID [2018-11-14 17:58:25,769 INFO L256 TraceCheckUtils]: 38: Hoare triple {2118#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 17:58:25,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {2118#false} is VALID [2018-11-14 17:58:25,770 INFO L273 TraceCheckUtils]: 40: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {2118#false} is VALID [2018-11-14 17:58:25,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {2118#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2118#false} is VALID [2018-11-14 17:58:25,771 INFO L273 TraceCheckUtils]: 43: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {2118#false} assume !~bvslt32(~i~0, 1000bv32); {2118#false} is VALID [2018-11-14 17:58:25,771 INFO L273 TraceCheckUtils]: 45: Hoare triple {2118#false} #res := ~res~0[32:0]; {2118#false} is VALID [2018-11-14 17:58:25,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,772 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2118#false} {2118#false} #73#return; {2118#false} is VALID [2018-11-14 17:58:25,772 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:58:25,772 INFO L256 TraceCheckUtils]: 49: Hoare triple {2118#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 17:58:25,772 INFO L273 TraceCheckUtils]: 50: Hoare triple {2118#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {2118#false} is VALID [2018-11-14 17:58:25,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,773 INFO L273 TraceCheckUtils]: 52: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {2118#false} is VALID [2018-11-14 17:58:25,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {2118#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2118#false} is VALID [2018-11-14 17:58:25,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {2118#false} assume !~bvslt32(~i~0, 1000bv32); {2118#false} is VALID [2018-11-14 17:58:25,774 INFO L273 TraceCheckUtils]: 56: Hoare triple {2118#false} #res := ~res~0[32:0]; {2118#false} is VALID [2018-11-14 17:58:25,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,774 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2118#false} {2118#false} #75#return; {2118#false} is VALID [2018-11-14 17:58:25,775 INFO L273 TraceCheckUtils]: 59: Hoare triple {2118#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {2118#false} is VALID [2018-11-14 17:58:25,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {2118#false} assume !~bvslt32(~i~2, 999bv32); {2118#false} is VALID [2018-11-14 17:58:25,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {2118#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:58:25,776 INFO L256 TraceCheckUtils]: 63: Hoare triple {2118#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 17:58:25,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {2118#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {2118#false} is VALID [2018-11-14 17:58:25,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,776 INFO L273 TraceCheckUtils]: 66: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {2118#false} is VALID [2018-11-14 17:58:25,777 INFO L273 TraceCheckUtils]: 67: Hoare triple {2118#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2118#false} is VALID [2018-11-14 17:58:25,777 INFO L273 TraceCheckUtils]: 68: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,777 INFO L273 TraceCheckUtils]: 69: Hoare triple {2118#false} assume !~bvslt32(~i~0, 1000bv32); {2118#false} is VALID [2018-11-14 17:58:25,777 INFO L273 TraceCheckUtils]: 70: Hoare triple {2118#false} #res := ~res~0[32:0]; {2118#false} is VALID [2018-11-14 17:58:25,778 INFO L273 TraceCheckUtils]: 71: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:25,778 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {2118#false} {2118#false} #77#return; {2118#false} is VALID [2018-11-14 17:58:25,778 INFO L273 TraceCheckUtils]: 73: Hoare triple {2118#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {2118#false} is VALID [2018-11-14 17:58:25,778 INFO L273 TraceCheckUtils]: 74: Hoare triple {2118#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2118#false} is VALID [2018-11-14 17:58:25,779 INFO L273 TraceCheckUtils]: 75: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2018-11-14 17:58:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:58:25,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:58:26,677 INFO L273 TraceCheckUtils]: 75: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2018-11-14 17:58:26,677 INFO L273 TraceCheckUtils]: 74: Hoare triple {2118#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2118#false} is VALID [2018-11-14 17:58:26,678 INFO L273 TraceCheckUtils]: 73: Hoare triple {2118#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {2118#false} is VALID [2018-11-14 17:58:26,678 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {2117#true} {2118#false} #77#return; {2118#false} is VALID [2018-11-14 17:58:26,678 INFO L273 TraceCheckUtils]: 71: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,678 INFO L273 TraceCheckUtils]: 70: Hoare triple {2117#true} #res := ~res~0[32:0]; {2117#true} is VALID [2018-11-14 17:58:26,678 INFO L273 TraceCheckUtils]: 69: Hoare triple {2117#true} assume !~bvslt32(~i~0, 1000bv32); {2117#true} is VALID [2018-11-14 17:58:26,678 INFO L273 TraceCheckUtils]: 68: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,678 INFO L273 TraceCheckUtils]: 67: Hoare triple {2117#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2117#true} is VALID [2018-11-14 17:58:26,679 INFO L273 TraceCheckUtils]: 66: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {2117#true} is VALID [2018-11-14 17:58:26,679 INFO L273 TraceCheckUtils]: 65: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,679 INFO L273 TraceCheckUtils]: 64: Hoare triple {2117#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {2117#true} is VALID [2018-11-14 17:58:26,679 INFO L256 TraceCheckUtils]: 63: Hoare triple {2118#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 17:58:26,679 INFO L273 TraceCheckUtils]: 62: Hoare triple {2118#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:58:26,679 INFO L273 TraceCheckUtils]: 61: Hoare triple {2118#false} assume !~bvslt32(~i~2, 999bv32); {2118#false} is VALID [2018-11-14 17:58:26,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 17:58:26,680 INFO L273 TraceCheckUtils]: 59: Hoare triple {2118#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {2118#false} is VALID [2018-11-14 17:58:26,680 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2117#true} {2118#false} #75#return; {2118#false} is VALID [2018-11-14 17:58:26,680 INFO L273 TraceCheckUtils]: 57: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,680 INFO L273 TraceCheckUtils]: 56: Hoare triple {2117#true} #res := ~res~0[32:0]; {2117#true} is VALID [2018-11-14 17:58:26,680 INFO L273 TraceCheckUtils]: 55: Hoare triple {2117#true} assume !~bvslt32(~i~0, 1000bv32); {2117#true} is VALID [2018-11-14 17:58:26,680 INFO L273 TraceCheckUtils]: 54: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,680 INFO L273 TraceCheckUtils]: 53: Hoare triple {2117#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2117#true} is VALID [2018-11-14 17:58:26,681 INFO L273 TraceCheckUtils]: 52: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {2117#true} is VALID [2018-11-14 17:58:26,681 INFO L273 TraceCheckUtils]: 51: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,681 INFO L273 TraceCheckUtils]: 50: Hoare triple {2117#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {2117#true} is VALID [2018-11-14 17:58:26,681 INFO L256 TraceCheckUtils]: 49: Hoare triple {2118#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 17:58:26,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 17:58:26,681 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2117#true} {2118#false} #73#return; {2118#false} is VALID [2018-11-14 17:58:26,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {2117#true} #res := ~res~0[32:0]; {2117#true} is VALID [2018-11-14 17:58:26,682 INFO L273 TraceCheckUtils]: 44: Hoare triple {2117#true} assume !~bvslt32(~i~0, 1000bv32); {2117#true} is VALID [2018-11-14 17:58:26,682 INFO L273 TraceCheckUtils]: 43: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,682 INFO L273 TraceCheckUtils]: 42: Hoare triple {2117#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2117#true} is VALID [2018-11-14 17:58:26,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {2117#true} is VALID [2018-11-14 17:58:26,682 INFO L273 TraceCheckUtils]: 40: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,682 INFO L273 TraceCheckUtils]: 39: Hoare triple {2117#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {2117#true} is VALID [2018-11-14 17:58:26,682 INFO L256 TraceCheckUtils]: 38: Hoare triple {2118#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 17:58:26,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {2472#(bvslt main_~i~1 (_ bv1000 32))} assume !~bvslt32(~i~1, 1000bv32); {2118#false} is VALID [2018-11-14 17:58:26,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {2472#(bvslt main_~i~1 (_ bv1000 32))} assume true; {2472#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:26,684 INFO L273 TraceCheckUtils]: 35: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2472#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:26,684 INFO L273 TraceCheckUtils]: 34: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume true; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} assume true; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} assume true; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,698 INFO L273 TraceCheckUtils]: 26: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} assume true; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} assume true; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} assume true; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} assume true; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} assume true; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} assume true; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} assume true; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {2117#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:26,753 INFO L256 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret13 := main(); {2117#true} is VALID [2018-11-14 17:58:26,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #69#return; {2117#true} is VALID [2018-11-14 17:58:26,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 17:58:26,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {2117#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2117#true} is VALID [2018-11-14 17:58:26,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2117#true} is VALID [2018-11-14 17:58:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:58:26,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:58:26,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 17:58:26,761 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-14 17:58:26,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:26,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:58:26,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:26,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:58:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:58:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:58:26,954 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 24 states. [2018-11-14 17:58:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:30,508 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-14 17:58:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:58:30,508 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-14 17:58:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:58:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 133 transitions. [2018-11-14 17:58:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:58:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 133 transitions. [2018-11-14 17:58:30,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 133 transitions. [2018-11-14 17:58:30,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:30,752 INFO L225 Difference]: With dead ends: 118 [2018-11-14 17:58:30,752 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 17:58:30,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:58:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 17:58:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-14 17:58:30,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:30,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-14 17:58:30,789 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-14 17:58:30,789 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-14 17:58:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:30,795 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:58:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:58:30,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:30,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:30,796 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-14 17:58:30,796 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-14 17:58:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:30,800 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:58:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:58:30,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:30,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:30,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:30,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 17:58:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-14 17:58:30,804 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 76 [2018-11-14 17:58:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:30,804 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-14 17:58:30,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:58:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:58:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 17:58:30,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:30,806 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:30,807 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:30,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1699540059, now seen corresponding path program 3 times [2018-11-14 17:58:30,807 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:30,807 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:58:30,831 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:58:30,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:58:30,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:58:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:30,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:31,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 17:58:31,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 17:58:31,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #69#return; {3097#true} is VALID [2018-11-14 17:58:31,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret13 := main(); {3097#true} is VALID [2018-11-14 17:58:31,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3097#true} is VALID [2018-11-14 17:58:31,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,052 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,053 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,053 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,056 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,056 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,056 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,056 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,057 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,057 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,057 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,058 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,058 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,059 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,059 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,059 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,059 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,060 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,060 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,060 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,060 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,060 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,061 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,061 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,061 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,061 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,061 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,061 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,062 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,062 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,062 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} assume !~bvslt32(~i~1, 1000bv32); {3097#true} is VALID [2018-11-14 17:58:31,062 INFO L256 TraceCheckUtils]: 74: Hoare triple {3097#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:58:31,062 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {3097#true} is VALID [2018-11-14 17:58:31,062 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,063 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {3097#true} is VALID [2018-11-14 17:58:31,063 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3097#true} is VALID [2018-11-14 17:58:31,063 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,063 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#true} assume !~bvslt32(~i~0, 1000bv32); {3097#true} is VALID [2018-11-14 17:58:31,063 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#true} #res := ~res~0[32:0]; {3097#true} is VALID [2018-11-14 17:58:31,064 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,064 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {3097#true} {3097#true} #73#return; {3097#true} is VALID [2018-11-14 17:58:31,064 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#true} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:58:31,064 INFO L256 TraceCheckUtils]: 85: Hoare triple {3097#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:58:31,064 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {3097#true} is VALID [2018-11-14 17:58:31,065 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,065 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {3097#true} is VALID [2018-11-14 17:58:31,065 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3097#true} is VALID [2018-11-14 17:58:31,065 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,065 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#true} assume !~bvslt32(~i~0, 1000bv32); {3097#true} is VALID [2018-11-14 17:58:31,066 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#true} #res := ~res~0[32:0]; {3097#true} is VALID [2018-11-14 17:58:31,066 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,066 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3097#true} {3097#true} #75#return; {3097#true} is VALID [2018-11-14 17:58:31,066 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#true} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {3097#true} is VALID [2018-11-14 17:58:31,067 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,067 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#true} assume !~bvslt32(~i~2, 999bv32); {3097#true} is VALID [2018-11-14 17:58:31,067 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:58:31,067 INFO L256 TraceCheckUtils]: 99: Hoare triple {3097#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:58:31,080 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {3402#(= (_ bv1 32) bor_~i~0)} is VALID [2018-11-14 17:58:31,093 INFO L273 TraceCheckUtils]: 101: Hoare triple {3402#(= (_ bv1 32) bor_~i~0)} assume true; {3402#(= (_ bv1 32) bor_~i~0)} is VALID [2018-11-14 17:58:31,109 INFO L273 TraceCheckUtils]: 102: Hoare triple {3402#(= (_ bv1 32) bor_~i~0)} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {3402#(= (_ bv1 32) bor_~i~0)} is VALID [2018-11-14 17:58:31,118 INFO L273 TraceCheckUtils]: 103: Hoare triple {3402#(= (_ bv1 32) bor_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3412#(= (_ bv2 32) bor_~i~0)} is VALID [2018-11-14 17:58:31,130 INFO L273 TraceCheckUtils]: 104: Hoare triple {3412#(= (_ bv2 32) bor_~i~0)} assume true; {3412#(= (_ bv2 32) bor_~i~0)} is VALID [2018-11-14 17:58:31,136 INFO L273 TraceCheckUtils]: 105: Hoare triple {3412#(= (_ bv2 32) bor_~i~0)} assume !~bvslt32(~i~0, 1000bv32); {3098#false} is VALID [2018-11-14 17:58:31,136 INFO L273 TraceCheckUtils]: 106: Hoare triple {3098#false} #res := ~res~0[32:0]; {3098#false} is VALID [2018-11-14 17:58:31,136 INFO L273 TraceCheckUtils]: 107: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 17:58:31,136 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {3098#false} {3097#true} #77#return; {3098#false} is VALID [2018-11-14 17:58:31,136 INFO L273 TraceCheckUtils]: 109: Hoare triple {3098#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {3098#false} is VALID [2018-11-14 17:58:31,137 INFO L273 TraceCheckUtils]: 110: Hoare triple {3098#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3098#false} is VALID [2018-11-14 17:58:31,137 INFO L273 TraceCheckUtils]: 111: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 17:58:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-11-14 17:58:31,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:58:31,477 INFO L273 TraceCheckUtils]: 111: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 17:58:31,477 INFO L273 TraceCheckUtils]: 110: Hoare triple {3098#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3098#false} is VALID [2018-11-14 17:58:31,477 INFO L273 TraceCheckUtils]: 109: Hoare triple {3098#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {3098#false} is VALID [2018-11-14 17:58:31,477 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {3098#false} {3097#true} #77#return; {3098#false} is VALID [2018-11-14 17:58:31,478 INFO L273 TraceCheckUtils]: 107: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 17:58:31,478 INFO L273 TraceCheckUtils]: 106: Hoare triple {3098#false} #res := ~res~0[32:0]; {3098#false} is VALID [2018-11-14 17:58:31,478 INFO L273 TraceCheckUtils]: 105: Hoare triple {3458#(bvslt bor_~i~0 (_ bv1000 32))} assume !~bvslt32(~i~0, 1000bv32); {3098#false} is VALID [2018-11-14 17:58:31,479 INFO L273 TraceCheckUtils]: 104: Hoare triple {3458#(bvslt bor_~i~0 (_ bv1000 32))} assume true; {3458#(bvslt bor_~i~0 (_ bv1000 32))} is VALID [2018-11-14 17:58:31,483 INFO L273 TraceCheckUtils]: 103: Hoare triple {3465#(bvslt (bvadd bor_~i~0 (_ bv1 32)) (_ bv1000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3458#(bvslt bor_~i~0 (_ bv1000 32))} is VALID [2018-11-14 17:58:31,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {3465#(bvslt (bvadd bor_~i~0 (_ bv1 32)) (_ bv1000 32))} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {3465#(bvslt (bvadd bor_~i~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:31,484 INFO L273 TraceCheckUtils]: 101: Hoare triple {3465#(bvslt (bvadd bor_~i~0 (_ bv1 32)) (_ bv1000 32))} assume true; {3465#(bvslt (bvadd bor_~i~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:31,486 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {3465#(bvslt (bvadd bor_~i~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:31,486 INFO L256 TraceCheckUtils]: 99: Hoare triple {3097#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:58:31,486 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:58:31,486 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#true} assume !~bvslt32(~i~2, 999bv32); {3097#true} is VALID [2018-11-14 17:58:31,487 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,487 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#true} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {3097#true} is VALID [2018-11-14 17:58:31,487 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3097#true} {3097#true} #75#return; {3097#true} is VALID [2018-11-14 17:58:31,487 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,487 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#true} #res := ~res~0[32:0]; {3097#true} is VALID [2018-11-14 17:58:31,487 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#true} assume !~bvslt32(~i~0, 1000bv32); {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L256 TraceCheckUtils]: 85: Hoare triple {3097#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#true} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 17:58:31,488 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {3097#true} {3097#true} #73#return; {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#true} #res := ~res~0[32:0]; {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#true} assume !~bvslt32(~i~0, 1000bv32); {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,489 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L256 TraceCheckUtils]: 74: Hoare triple {3097#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} assume !~bvslt32(~i~1, 1000bv32); {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,492 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,492 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,492 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,492 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,492 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,492 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,492 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,493 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,493 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,493 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,493 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,493 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,493 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,494 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,494 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,494 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,495 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,495 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,495 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,496 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,496 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,496 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3097#true} is VALID [2018-11-14 17:58:31,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {3097#true} is VALID [2018-11-14 17:58:31,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3097#true} is VALID [2018-11-14 17:58:31,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret13 := main(); {3097#true} is VALID [2018-11-14 17:58:31,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #69#return; {3097#true} is VALID [2018-11-14 17:58:31,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:58:31,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 17:58:31,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 17:58:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-11-14 17:58:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:58:31,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:58:31,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-14 17:58:31,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:31,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:58:31,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:31,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:58:31,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:58:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:58:31,634 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2018-11-14 17:58:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:31,924 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-11-14 17:58:31,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:58:31,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-14 17:58:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:58:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:58:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:58:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:58:31,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2018-11-14 17:58:32,052 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 17:58:32,054 INFO L225 Difference]: With dead ends: 126 [2018-11-14 17:58:32,055 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 17:58:32,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:58:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 17:58:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-14 17:58:32,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:32,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2018-11-14 17:58:32,233 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-14 17:58:32,233 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-14 17:58:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:32,240 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-14 17:58:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 17:58:32,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:32,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:32,241 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-14 17:58:32,241 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-14 17:58:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:32,245 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-14 17:58:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 17:58:32,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:32,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:32,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:32,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 17:58:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-14 17:58:32,249 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 112 [2018-11-14 17:58:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:32,249 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-14 17:58:32,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:58:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 17:58:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-14 17:58:32,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:32,251 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:32,252 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:32,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1458155117, now seen corresponding path program 4 times [2018-11-14 17:58:32,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:32,252 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:58:32,271 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:58:32,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:58:32,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:58:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:58:32,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:58:33,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2018-11-14 17:58:33,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4297#true} is VALID [2018-11-14 17:58:33,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:33,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4297#true} {4297#true} #69#return; {4297#true} is VALID [2018-11-14 17:58:33,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {4297#true} call #t~ret13 := main(); {4297#true} is VALID [2018-11-14 17:58:33,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {4297#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:33,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} assume true; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:33,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:58:33,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,090 INFO L273 TraceCheckUtils]: 14: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:58:33,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} assume true; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:58:33,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 17:58:33,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume true; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:58:33,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} assume true; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:58:33,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 17:58:33,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume true; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,101 INFO L273 TraceCheckUtils]: 31: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:58:33,102 INFO L273 TraceCheckUtils]: 33: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} assume true; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:58:33,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 17:58:33,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume true; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,104 INFO L273 TraceCheckUtils]: 37: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 17:58:33,106 INFO L273 TraceCheckUtils]: 39: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} assume true; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 17:58:33,106 INFO L273 TraceCheckUtils]: 40: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 17:58:33,107 INFO L273 TraceCheckUtils]: 41: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,108 INFO L273 TraceCheckUtils]: 42: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} assume true; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,108 INFO L273 TraceCheckUtils]: 43: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,109 INFO L273 TraceCheckUtils]: 44: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 17:58:33,110 INFO L273 TraceCheckUtils]: 45: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} assume true; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 17:58:33,110 INFO L273 TraceCheckUtils]: 46: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 17:58:33,111 INFO L273 TraceCheckUtils]: 47: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} assume true; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,112 INFO L273 TraceCheckUtils]: 49: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,113 INFO L273 TraceCheckUtils]: 50: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 17:58:33,113 INFO L273 TraceCheckUtils]: 51: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} assume true; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 17:58:33,114 INFO L273 TraceCheckUtils]: 52: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 17:58:33,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,115 INFO L273 TraceCheckUtils]: 54: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} assume true; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 17:58:33,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} assume true; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 17:58:33,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 17:58:33,119 INFO L273 TraceCheckUtils]: 59: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} assume true; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 17:58:33,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} assume true; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 17:58:33,122 INFO L273 TraceCheckUtils]: 64: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 17:58:33,122 INFO L273 TraceCheckUtils]: 65: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,123 INFO L273 TraceCheckUtils]: 66: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} assume true; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,124 INFO L273 TraceCheckUtils]: 68: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 17:58:33,125 INFO L273 TraceCheckUtils]: 69: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} assume true; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 17:58:33,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 17:58:33,126 INFO L273 TraceCheckUtils]: 71: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} assume true; {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:58:33,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 1000bv32); {4298#false} is VALID [2018-11-14 17:58:33,128 INFO L256 TraceCheckUtils]: 74: Hoare triple {4298#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 17:58:33,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {4298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {4298#false} is VALID [2018-11-14 17:58:33,128 INFO L273 TraceCheckUtils]: 76: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,128 INFO L273 TraceCheckUtils]: 77: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,129 INFO L273 TraceCheckUtils]: 78: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,129 INFO L273 TraceCheckUtils]: 79: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,129 INFO L273 TraceCheckUtils]: 80: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,129 INFO L273 TraceCheckUtils]: 81: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,129 INFO L273 TraceCheckUtils]: 82: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,130 INFO L273 TraceCheckUtils]: 83: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,130 INFO L273 TraceCheckUtils]: 84: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,130 INFO L273 TraceCheckUtils]: 85: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,130 INFO L273 TraceCheckUtils]: 86: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,130 INFO L273 TraceCheckUtils]: 87: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,131 INFO L273 TraceCheckUtils]: 88: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,131 INFO L273 TraceCheckUtils]: 89: Hoare triple {4298#false} assume !~bvslt32(~i~0, 1000bv32); {4298#false} is VALID [2018-11-14 17:58:33,131 INFO L273 TraceCheckUtils]: 90: Hoare triple {4298#false} #res := ~res~0[32:0]; {4298#false} is VALID [2018-11-14 17:58:33,131 INFO L273 TraceCheckUtils]: 91: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,131 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {4298#false} {4298#false} #73#return; {4298#false} is VALID [2018-11-14 17:58:33,131 INFO L273 TraceCheckUtils]: 93: Hoare triple {4298#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:58:33,132 INFO L256 TraceCheckUtils]: 94: Hoare triple {4298#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 17:58:33,132 INFO L273 TraceCheckUtils]: 95: Hoare triple {4298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {4298#false} is VALID [2018-11-14 17:58:33,132 INFO L273 TraceCheckUtils]: 96: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,132 INFO L273 TraceCheckUtils]: 97: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,132 INFO L273 TraceCheckUtils]: 98: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,133 INFO L273 TraceCheckUtils]: 99: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,133 INFO L273 TraceCheckUtils]: 100: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,133 INFO L273 TraceCheckUtils]: 101: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,133 INFO L273 TraceCheckUtils]: 102: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,133 INFO L273 TraceCheckUtils]: 103: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,134 INFO L273 TraceCheckUtils]: 104: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,134 INFO L273 TraceCheckUtils]: 105: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,134 INFO L273 TraceCheckUtils]: 106: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,134 INFO L273 TraceCheckUtils]: 107: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,134 INFO L273 TraceCheckUtils]: 108: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,134 INFO L273 TraceCheckUtils]: 109: Hoare triple {4298#false} assume !~bvslt32(~i~0, 1000bv32); {4298#false} is VALID [2018-11-14 17:58:33,135 INFO L273 TraceCheckUtils]: 110: Hoare triple {4298#false} #res := ~res~0[32:0]; {4298#false} is VALID [2018-11-14 17:58:33,135 INFO L273 TraceCheckUtils]: 111: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,135 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {4298#false} {4298#false} #75#return; {4298#false} is VALID [2018-11-14 17:58:33,135 INFO L273 TraceCheckUtils]: 113: Hoare triple {4298#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {4298#false} is VALID [2018-11-14 17:58:33,135 INFO L273 TraceCheckUtils]: 114: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,136 INFO L273 TraceCheckUtils]: 115: Hoare triple {4298#false} assume !~bvslt32(~i~2, 999bv32); {4298#false} is VALID [2018-11-14 17:58:33,136 INFO L273 TraceCheckUtils]: 116: Hoare triple {4298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:58:33,136 INFO L256 TraceCheckUtils]: 117: Hoare triple {4298#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 17:58:33,136 INFO L273 TraceCheckUtils]: 118: Hoare triple {4298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {4298#false} is VALID [2018-11-14 17:58:33,136 INFO L273 TraceCheckUtils]: 119: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,136 INFO L273 TraceCheckUtils]: 120: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,137 INFO L273 TraceCheckUtils]: 121: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,137 INFO L273 TraceCheckUtils]: 122: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,137 INFO L273 TraceCheckUtils]: 123: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,137 INFO L273 TraceCheckUtils]: 124: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,137 INFO L273 TraceCheckUtils]: 125: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,138 INFO L273 TraceCheckUtils]: 126: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,138 INFO L273 TraceCheckUtils]: 127: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,138 INFO L273 TraceCheckUtils]: 128: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,138 INFO L273 TraceCheckUtils]: 129: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4298#false} is VALID [2018-11-14 17:58:33,138 INFO L273 TraceCheckUtils]: 130: Hoare triple {4298#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4298#false} is VALID [2018-11-14 17:58:33,138 INFO L273 TraceCheckUtils]: 131: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,139 INFO L273 TraceCheckUtils]: 132: Hoare triple {4298#false} assume !~bvslt32(~i~0, 1000bv32); {4298#false} is VALID [2018-11-14 17:58:33,139 INFO L273 TraceCheckUtils]: 133: Hoare triple {4298#false} #res := ~res~0[32:0]; {4298#false} is VALID [2018-11-14 17:58:33,139 INFO L273 TraceCheckUtils]: 134: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:33,139 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {4298#false} {4298#false} #77#return; {4298#false} is VALID [2018-11-14 17:58:33,139 INFO L273 TraceCheckUtils]: 136: Hoare triple {4298#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {4298#false} is VALID [2018-11-14 17:58:33,140 INFO L273 TraceCheckUtils]: 137: Hoare triple {4298#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4298#false} is VALID [2018-11-14 17:58:33,140 INFO L273 TraceCheckUtils]: 138: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2018-11-14 17:58:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 17:58:33,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:58:35,800 INFO L273 TraceCheckUtils]: 138: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2018-11-14 17:58:35,801 INFO L273 TraceCheckUtils]: 137: Hoare triple {4298#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4298#false} is VALID [2018-11-14 17:58:35,801 INFO L273 TraceCheckUtils]: 136: Hoare triple {4298#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {4298#false} is VALID [2018-11-14 17:58:35,801 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {4297#true} {4298#false} #77#return; {4298#false} is VALID [2018-11-14 17:58:35,801 INFO L273 TraceCheckUtils]: 134: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,801 INFO L273 TraceCheckUtils]: 133: Hoare triple {4297#true} #res := ~res~0[32:0]; {4297#true} is VALID [2018-11-14 17:58:35,801 INFO L273 TraceCheckUtils]: 132: Hoare triple {4297#true} assume !~bvslt32(~i~0, 1000bv32); {4297#true} is VALID [2018-11-14 17:58:35,801 INFO L273 TraceCheckUtils]: 131: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 130: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 129: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 128: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 127: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 126: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 125: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 124: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,802 INFO L273 TraceCheckUtils]: 123: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 122: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 121: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 120: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 119: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 118: Hoare triple {4297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {4297#true} is VALID [2018-11-14 17:58:35,803 INFO L256 TraceCheckUtils]: 117: Hoare triple {4298#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 116: Hoare triple {4298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(3996bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 115: Hoare triple {4298#false} assume !~bvslt32(~i~2, 999bv32); {4298#false} is VALID [2018-11-14 17:58:35,803 INFO L273 TraceCheckUtils]: 114: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 17:58:35,804 INFO L273 TraceCheckUtils]: 113: Hoare triple {4298#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0bv32; {4298#false} is VALID [2018-11-14 17:58:35,804 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {4297#true} {4298#false} #75#return; {4298#false} is VALID [2018-11-14 17:58:35,804 INFO L273 TraceCheckUtils]: 111: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,804 INFO L273 TraceCheckUtils]: 110: Hoare triple {4297#true} #res := ~res~0[32:0]; {4297#true} is VALID [2018-11-14 17:58:35,804 INFO L273 TraceCheckUtils]: 109: Hoare triple {4297#true} assume !~bvslt32(~i~0, 1000bv32); {4297#true} is VALID [2018-11-14 17:58:35,804 INFO L273 TraceCheckUtils]: 108: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,804 INFO L273 TraceCheckUtils]: 107: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,804 INFO L273 TraceCheckUtils]: 106: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,805 INFO L273 TraceCheckUtils]: 105: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,805 INFO L273 TraceCheckUtils]: 104: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,805 INFO L273 TraceCheckUtils]: 103: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,805 INFO L273 TraceCheckUtils]: 102: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,805 INFO L273 TraceCheckUtils]: 101: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,805 INFO L273 TraceCheckUtils]: 100: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,806 INFO L273 TraceCheckUtils]: 99: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,806 INFO L273 TraceCheckUtils]: 98: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,806 INFO L273 TraceCheckUtils]: 97: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,806 INFO L273 TraceCheckUtils]: 96: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,806 INFO L273 TraceCheckUtils]: 95: Hoare triple {4297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {4297#true} is VALID [2018-11-14 17:58:35,806 INFO L256 TraceCheckUtils]: 94: Hoare triple {4298#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 17:58:35,807 INFO L273 TraceCheckUtils]: 93: Hoare triple {4298#false} ~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 17:58:35,807 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {4297#true} {4298#false} #73#return; {4298#false} is VALID [2018-11-14 17:58:35,807 INFO L273 TraceCheckUtils]: 91: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,807 INFO L273 TraceCheckUtils]: 90: Hoare triple {4297#true} #res := ~res~0[32:0]; {4297#true} is VALID [2018-11-14 17:58:35,807 INFO L273 TraceCheckUtils]: 89: Hoare triple {4297#true} assume !~bvslt32(~i~0, 1000bv32); {4297#true} is VALID [2018-11-14 17:58:35,807 INFO L273 TraceCheckUtils]: 88: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,808 INFO L273 TraceCheckUtils]: 87: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,808 INFO L273 TraceCheckUtils]: 86: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,808 INFO L273 TraceCheckUtils]: 85: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,808 INFO L273 TraceCheckUtils]: 84: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,808 INFO L273 TraceCheckUtils]: 82: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L273 TraceCheckUtils]: 81: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L273 TraceCheckUtils]: 80: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L273 TraceCheckUtils]: 79: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L273 TraceCheckUtils]: 78: Hoare triple {4297#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 1000bv32);call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~res~0 := ~bvor64(~res~0, ~sign_extendFrom32To64(#t~mem2));havoc #t~mem2; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {4297#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~intINTTYPE4(~x.base, ~x.offset, 4bv32);~res~0 := ~sign_extendFrom32To64(#t~mem0);havoc #t~mem0;~i~0 := 1bv32; {4297#true} is VALID [2018-11-14 17:58:35,809 INFO L256 TraceCheckUtils]: 74: Hoare triple {4298#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 17:58:35,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {4934#(bvslt main_~i~1 (_ bv1000 32))} assume !~bvslt32(~i~1, 1000bv32); {4298#false} is VALID [2018-11-14 17:58:35,812 INFO L273 TraceCheckUtils]: 72: Hoare triple {4934#(bvslt main_~i~1 (_ bv1000 32))} assume true; {4934#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:35,812 INFO L273 TraceCheckUtils]: 71: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4934#(bvslt main_~i~1 (_ bv1000 32))} is VALID [2018-11-14 17:58:35,812 INFO L273 TraceCheckUtils]: 70: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,813 INFO L273 TraceCheckUtils]: 69: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} assume true; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,817 INFO L273 TraceCheckUtils]: 67: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,817 INFO L273 TraceCheckUtils]: 66: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} assume true; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,821 INFO L273 TraceCheckUtils]: 65: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,822 INFO L273 TraceCheckUtils]: 64: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} assume true; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,826 INFO L273 TraceCheckUtils]: 62: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,826 INFO L273 TraceCheckUtils]: 61: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,826 INFO L273 TraceCheckUtils]: 60: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} assume true; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} assume true; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,836 INFO L273 TraceCheckUtils]: 56: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,837 INFO L273 TraceCheckUtils]: 54: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} assume true; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,844 INFO L273 TraceCheckUtils]: 52: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,844 INFO L273 TraceCheckUtils]: 51: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} assume true; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,848 INFO L273 TraceCheckUtils]: 50: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,848 INFO L273 TraceCheckUtils]: 49: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} assume true; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,854 INFO L273 TraceCheckUtils]: 46: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} assume true; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,858 INFO L273 TraceCheckUtils]: 44: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,859 INFO L273 TraceCheckUtils]: 43: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} assume true; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,864 INFO L273 TraceCheckUtils]: 41: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,864 INFO L273 TraceCheckUtils]: 40: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv1000 32))} assume true; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,871 INFO L273 TraceCheckUtils]: 38: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,871 INFO L273 TraceCheckUtils]: 37: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,872 INFO L273 TraceCheckUtils]: 36: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv1000 32))} assume true; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv1000 32))} assume true; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,882 INFO L273 TraceCheckUtils]: 32: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv1000 32))} assume true; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv1000 32))} assume true; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,899 INFO L273 TraceCheckUtils]: 25: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv1000 32))} assume true; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv1000 32))} assume true; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv1000 32))} assume true; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv1000 32))} assume true; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv1000 32))} assume true; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv1000 32))} assume true; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv1000 32))} #t~post3 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv1000 32))} assume !!~bvslt32(~i~1, 1000bv32);call write~intINTTYPE4(#t~nondet4, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet4; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv1000 32))} assume true; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {4297#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000bv32);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-14 17:58:35,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {4297#true} call #t~ret13 := main(); {4297#true} is VALID [2018-11-14 17:58:35,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4297#true} {4297#true} #69#return; {4297#true} is VALID [2018-11-14 17:58:35,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 17:58:35,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4297#true} is VALID [2018-11-14 17:58:35,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2018-11-14 17:58:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 17:58:35,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:58:35,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 17:58:35,959 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-14 17:58:35,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:58:35,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:58:36,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:36,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:58:36,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:58:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:58:36,300 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 48 states. [2018-11-14 17:58:41,547 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 17:58:42,095 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 17:58:42,637 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 17:58:43,230 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 17:58:43,829 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 17:58:44,436 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 17:58:45,034 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 17:58:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:53,415 INFO L93 Difference]: Finished difference Result 208 states and 239 transitions. [2018-11-14 17:58:53,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 17:58:53,415 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-14 17:58:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:58:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:58:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 217 transitions. [2018-11-14 17:58:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:58:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 217 transitions. [2018-11-14 17:58:53,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 217 transitions. [2018-11-14 17:58:53,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:58:53,843 INFO L225 Difference]: With dead ends: 208 [2018-11-14 17:58:53,844 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 17:58:53,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 17:58:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 17:58:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-14 17:58:53,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:58:53,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 177 states. [2018-11-14 17:58:53,908 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2018-11-14 17:58:53,908 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2018-11-14 17:58:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:53,915 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-11-14 17:58:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2018-11-14 17:58:53,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:53,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:53,916 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2018-11-14 17:58:53,916 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2018-11-14 17:58:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:58:53,922 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-11-14 17:58:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2018-11-14 17:58:53,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:58:53,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:58:53,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:58:53,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:58:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-14 17:58:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2018-11-14 17:58:53,929 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 139 [2018-11-14 17:58:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:58:53,930 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2018-11-14 17:58:53,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:58:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2018-11-14 17:58:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 17:58:53,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:58:53,933 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:58:53,933 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:58:53,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:58:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash 983583891, now seen corresponding path program 5 times [2018-11-14 17:58:53,934 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:58:53,934 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:58:53,961 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1