java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:27,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:27,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:27,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:27,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:27,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:27,796 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:27,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:27,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:27,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:27,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:27,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:27,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:27,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:27,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:27,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:27,807 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:27,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:27,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:27,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:27,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:27,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:27,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:27,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:27,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:27,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:27,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:27,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:27,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:27,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:27,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:27,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:27,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:27,825 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:27,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:27,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:27,827 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:02:27,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:27,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:27,844 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:27,844 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:27,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:27,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:27,845 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:27,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:27,845 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:27,846 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:27,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:27,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:27,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:27,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:27,846 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:27,847 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:27,847 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:27,847 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:27,847 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:27,847 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:27,848 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:27,848 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:27,848 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:27,848 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:27,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:27,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:27,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:27,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:27,849 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:27,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:27,850 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:27,850 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:27,850 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:27,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:27,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:27,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:27,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:27,913 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:27,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i [2018-11-23 10:02:27,972 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15749c6e3/f049a03d1db648cd8618a36171e848ba/FLAGa94c56519 [2018-11-23 10:02:28,393 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:28,394 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_true-unreach-call_ground.i [2018-11-23 10:02:28,400 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15749c6e3/f049a03d1db648cd8618a36171e848ba/FLAGa94c56519 [2018-11-23 10:02:28,763 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15749c6e3/f049a03d1db648cd8618a36171e848ba [2018-11-23 10:02:28,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:28,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:28,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:28,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:28,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:28,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:28" (1/1) ... [2018-11-23 10:02:28,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f245ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:28, skipping insertion in model container [2018-11-23 10:02:28,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:28" (1/1) ... [2018-11-23 10:02:28,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:28,821 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:29,062 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:29,067 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:29,097 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:29,125 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:29,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29 WrapperNode [2018-11-23 10:02:29,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:29,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:29,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:29,127 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:29,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:29,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:29,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:29,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:29,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... [2018-11-23 10:02:29,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:29,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:29,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:29,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:29,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:29,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:29,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:29,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:29,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:29,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:29,994 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:29,995 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 10:02:29,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:29 BoogieIcfgContainer [2018-11-23 10:02:29,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:29,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:29,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:30,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:30,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:28" (1/3) ... [2018-11-23 10:02:30,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6603df15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:30, skipping insertion in model container [2018-11-23 10:02:30,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:29" (2/3) ... [2018-11-23 10:02:30,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6603df15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:30, skipping insertion in model container [2018-11-23 10:02:30,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:29" (3/3) ... [2018-11-23 10:02:30,004 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy2_true-unreach-call_ground.i [2018-11-23 10:02:30,014 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:30,022 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:30,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:30,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:30,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:30,074 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:30,074 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:30,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:30,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:30,075 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:30,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:30,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 10:02:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:02:30,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:30,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:30,104 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:30,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:30,111 INFO L82 PathProgramCache]: Analyzing trace with hash 415311520, now seen corresponding path program 1 times [2018-11-23 10:02:30,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:30,116 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:30,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:30,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:30,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 10:02:30,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 10:02:30,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 10:02:30,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-23 10:02:30,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret9 := main(); {33#true} is VALID [2018-11-23 10:02:30,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {33#true} is VALID [2018-11-23 10:02:30,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 10:02:30,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~i~0;~i~0 := 0bv32; {34#false} is VALID [2018-11-23 10:02:30,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !~bvslt32(~i~0, 100000bv32); {34#false} is VALID [2018-11-23 10:02:30,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0bv32; {34#false} is VALID [2018-11-23 10:02:30,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !~bvslt32(~i~0, 100000bv32); {34#false} is VALID [2018-11-23 10:02:30,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} havoc ~x~0;~x~0 := 0bv32; {34#false} is VALID [2018-11-23 10:02:30,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {34#false} is VALID [2018-11-23 10:02:30,488 INFO L256 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 10:02:30,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 10:02:30,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 10:02:30,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 10:02:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:30,494 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:30,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:30,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:30,509 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 10:02:30,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:30,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:30,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:30,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:30,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:30,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:30,697 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 10:02:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:30,837 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-23 10:02:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:30,838 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 10:02:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 10:02:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 10:02:30,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2018-11-23 10:02:31,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:31,159 INFO L225 Difference]: With dead ends: 52 [2018-11-23 10:02:31,159 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 10:02:31,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 10:02:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 10:02:31,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:31,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 10:02:31,218 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:02:31,218 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:02:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,223 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 10:02:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:02:31,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:31,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:31,224 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:02:31,224 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:02:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,229 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 10:02:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:02:31,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:31,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:31,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:31,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:02:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 10:02:31,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 10:02:31,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:31,236 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 10:02:31,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:02:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:02:31,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:31,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:31,238 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:31,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:31,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1687882214, now seen corresponding path program 1 times [2018-11-23 10:02:31,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:31,239 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:31,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:31,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:31,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 10:02:31,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {237#true} is VALID [2018-11-23 10:02:31,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 10:02:31,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #77#return; {237#true} is VALID [2018-11-23 10:02:31,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret9 := main(); {237#true} is VALID [2018-11-23 10:02:31,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {257#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:31,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {238#false} is VALID [2018-11-23 10:02:31,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {238#false} havoc ~i~0;~i~0 := 0bv32; {238#false} is VALID [2018-11-23 10:02:31,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {238#false} assume !~bvslt32(~i~0, 100000bv32); {238#false} is VALID [2018-11-23 10:02:31,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {238#false} ~i~0 := 0bv32; {238#false} is VALID [2018-11-23 10:02:31,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {238#false} assume !~bvslt32(~i~0, 100000bv32); {238#false} is VALID [2018-11-23 10:02:31,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {238#false} havoc ~x~0;~x~0 := 0bv32; {238#false} is VALID [2018-11-23 10:02:31,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {238#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {238#false} is VALID [2018-11-23 10:02:31,388 INFO L256 TraceCheckUtils]: 13: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {238#false} is VALID [2018-11-23 10:02:31,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 10:02:31,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume 0bv32 == ~cond; {238#false} is VALID [2018-11-23 10:02:31,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 10:02:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:31,391 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:31,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:31,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:31,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:02:31,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:31,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:31,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:31,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:31,500 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-23 10:02:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,910 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 10:02:31,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:31,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:02:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 10:02:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 10:02:31,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-23 10:02:32,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:32,095 INFO L225 Difference]: With dead ends: 44 [2018-11-23 10:02:32,095 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 10:02:32,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 10:02:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 10:02:32,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:32,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 10:02:32,113 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 10:02:32,113 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 10:02:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,117 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:02:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:02:32,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,118 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 10:02:32,118 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 10:02:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,121 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:02:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:02:32,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:32,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:02:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 10:02:32,125 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-23 10:02:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:32,125 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 10:02:32,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 10:02:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:02:32,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:32,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1114616120, now seen corresponding path program 1 times [2018-11-23 10:02:32,128 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:32,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:32,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 10:02:32,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 10:02:32,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 10:02:32,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #77#return; {441#true} is VALID [2018-11-23 10:02:32,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret9 := main(); {441#true} is VALID [2018-11-23 10:02:32,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {461#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:32,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {461#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:32,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {468#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:32,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {442#false} is VALID [2018-11-23 10:02:32,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {442#false} havoc ~i~0;~i~0 := 0bv32; {442#false} is VALID [2018-11-23 10:02:32,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 10:02:32,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} ~i~0 := 0bv32; {442#false} is VALID [2018-11-23 10:02:32,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 10:02:32,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#false} havoc ~x~0;~x~0 := 0bv32; {442#false} is VALID [2018-11-23 10:02:32,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {442#false} is VALID [2018-11-23 10:02:32,290 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-23 10:02:32,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-23 10:02:32,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume 0bv32 == ~cond; {442#false} is VALID [2018-11-23 10:02:32,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 10:02:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:32,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:32,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 10:02:32,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume 0bv32 == ~cond; {442#false} is VALID [2018-11-23 10:02:32,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-23 10:02:32,585 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-23 10:02:32,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {442#false} is VALID [2018-11-23 10:02:32,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#false} havoc ~x~0;~x~0 := 0bv32; {442#false} is VALID [2018-11-23 10:02:32,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 10:02:32,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} ~i~0 := 0bv32; {442#false} is VALID [2018-11-23 10:02:32,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 10:02:32,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {442#false} havoc ~i~0;~i~0 := 0bv32; {442#false} is VALID [2018-11-23 10:02:32,596 INFO L273 TraceCheckUtils]: 8: Hoare triple {532#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {442#false} is VALID [2018-11-23 10:02:32,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {532#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:32,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret9 := main(); {441#true} is VALID [2018-11-23 10:02:32,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #77#return; {441#true} is VALID [2018-11-23 10:02:32,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 10:02:32,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 10:02:32,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 10:02:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:32,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:32,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:32,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 10:02:32,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:32,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:32,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:32,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:32,693 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2018-11-23 10:02:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,165 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 10:02:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:33,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 10:02:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 10:02:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 10:02:33,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-23 10:02:33,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,271 INFO L225 Difference]: With dead ends: 49 [2018-11-23 10:02:33,271 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 10:02:33,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 10:02:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 10:02:33,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:33,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 10:02:33,294 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 10:02:33,294 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 10:02:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,297 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 10:02:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 10:02:33,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:33,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:33,298 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 10:02:33,298 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 10:02:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,301 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 10:02:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 10:02:33,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:33,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:33,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:33,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 10:02:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 10:02:33,305 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 19 [2018-11-23 10:02:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:33,305 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 10:02:33,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 10:02:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:02:33,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:33,306 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:33,307 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:33,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash -933132910, now seen corresponding path program 2 times [2018-11-23 10:02:33,308 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:33,308 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:33,330 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:33,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:33,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:33,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2018-11-23 10:02:33,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {740#true} is VALID [2018-11-23 10:02:33,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2018-11-23 10:02:33,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #77#return; {740#true} is VALID [2018-11-23 10:02:33,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret9 := main(); {740#true} is VALID [2018-11-23 10:02:33,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {740#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {740#true} is VALID [2018-11-23 10:02:33,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {740#true} is VALID [2018-11-23 10:02:33,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 10:02:33,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {740#true} is VALID [2018-11-23 10:02:33,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 10:02:33,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {740#true} is VALID [2018-11-23 10:02:33,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 10:02:33,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {740#true} is VALID [2018-11-23 10:02:33,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 10:02:33,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {740#true} assume !~bvslt32(~a~0, 100000bv32); {740#true} is VALID [2018-11-23 10:02:33,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {740#true} havoc ~i~0;~i~0 := 0bv32; {790#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:33,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {790#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {741#false} is VALID [2018-11-23 10:02:33,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {741#false} ~i~0 := 0bv32; {741#false} is VALID [2018-11-23 10:02:33,447 INFO L273 TraceCheckUtils]: 18: Hoare triple {741#false} assume !~bvslt32(~i~0, 100000bv32); {741#false} is VALID [2018-11-23 10:02:33,447 INFO L273 TraceCheckUtils]: 19: Hoare triple {741#false} havoc ~x~0;~x~0 := 0bv32; {741#false} is VALID [2018-11-23 10:02:33,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {741#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {741#false} is VALID [2018-11-23 10:02:33,448 INFO L256 TraceCheckUtils]: 21: Hoare triple {741#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {741#false} is VALID [2018-11-23 10:02:33,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2018-11-23 10:02:33,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {741#false} assume 0bv32 == ~cond; {741#false} is VALID [2018-11-23 10:02:33,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {741#false} assume !false; {741#false} is VALID [2018-11-23 10:02:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:02:33,450 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:33,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:33,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:33,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:02:33,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:33,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:33,487 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-11-23 10:02:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,650 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 10:02:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:33,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:02:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 10:02:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 10:02:33,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 10:02:33,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,765 INFO L225 Difference]: With dead ends: 50 [2018-11-23 10:02:33,765 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 10:02:33,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 10:02:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-23 10:02:33,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:33,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-23 10:02:33,780 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-23 10:02:33,780 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-23 10:02:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,783 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 10:02:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 10:02:33,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:33,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:33,784 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-23 10:02:33,784 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-23 10:02:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:33,787 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 10:02:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 10:02:33,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:33,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:33,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:33,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:02:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 10:02:33,790 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-11-23 10:02:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:33,791 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 10:02:33,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 10:02:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:02:33,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:33,792 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:33,792 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:33,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:33,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1532326002, now seen corresponding path program 1 times [2018-11-23 10:02:33,795 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:33,795 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:33,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:34,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2018-11-23 10:02:34,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {1009#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1009#true} is VALID [2018-11-23 10:02:34,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {1009#true} assume true; {1009#true} is VALID [2018-11-23 10:02:34,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1009#true} {1009#true} #77#return; {1009#true} is VALID [2018-11-23 10:02:34,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {1009#true} call #t~ret9 := main(); {1009#true} is VALID [2018-11-23 10:02:34,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {1009#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1029#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:34,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {1029#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1029#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:34,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {1029#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1036#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:34,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {1036#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1036#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:34,067 INFO L273 TraceCheckUtils]: 9: Hoare triple {1036#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1043#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:34,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {1043#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1043#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:34,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {1043#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1050#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:34,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {1050#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1050#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:34,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {1050#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1057#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:34,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {1057#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1010#false} is VALID [2018-11-23 10:02:34,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {1010#false} havoc ~i~0;~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 10:02:34,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1010#false} is VALID [2018-11-23 10:02:34,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {1010#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1010#false} is VALID [2018-11-23 10:02:34,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 10:02:34,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {1010#false} ~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 10:02:34,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1010#false} is VALID [2018-11-23 10:02:34,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {1010#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#false} is VALID [2018-11-23 10:02:34,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 10:02:34,075 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#false} havoc ~x~0;~x~0 := 0bv32; {1010#false} is VALID [2018-11-23 10:02:34,075 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1010#false} is VALID [2018-11-23 10:02:34,076 INFO L256 TraceCheckUtils]: 25: Hoare triple {1010#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {1010#false} is VALID [2018-11-23 10:02:34,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {1010#false} ~cond := #in~cond; {1010#false} is VALID [2018-11-23 10:02:34,077 INFO L273 TraceCheckUtils]: 27: Hoare triple {1010#false} assume 0bv32 == ~cond; {1010#false} is VALID [2018-11-23 10:02:34,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2018-11-23 10:02:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:02:34,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:34,400 INFO L273 TraceCheckUtils]: 28: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2018-11-23 10:02:34,400 INFO L273 TraceCheckUtils]: 27: Hoare triple {1010#false} assume 0bv32 == ~cond; {1010#false} is VALID [2018-11-23 10:02:34,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {1010#false} ~cond := #in~cond; {1010#false} is VALID [2018-11-23 10:02:34,401 INFO L256 TraceCheckUtils]: 25: Hoare triple {1010#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {1010#false} is VALID [2018-11-23 10:02:34,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1010#false} is VALID [2018-11-23 10:02:34,402 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#false} havoc ~x~0;~x~0 := 0bv32; {1010#false} is VALID [2018-11-23 10:02:34,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 10:02:34,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {1010#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1010#false} is VALID [2018-11-23 10:02:34,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1010#false} is VALID [2018-11-23 10:02:34,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {1010#false} ~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 10:02:34,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 10:02:34,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {1010#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1010#false} is VALID [2018-11-23 10:02:34,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1010#false} is VALID [2018-11-23 10:02:34,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {1010#false} havoc ~i~0;~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 10:02:34,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {1145#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1010#false} is VALID [2018-11-23 10:02:34,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1145#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:34,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {1009#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:34,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {1009#true} call #t~ret9 := main(); {1009#true} is VALID [2018-11-23 10:02:34,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1009#true} {1009#true} #77#return; {1009#true} is VALID [2018-11-23 10:02:34,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {1009#true} assume true; {1009#true} is VALID [2018-11-23 10:02:34,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {1009#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1009#true} is VALID [2018-11-23 10:02:34,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2018-11-23 10:02:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:02:34,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:34,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:34,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 10:02:34,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:34,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:34,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:34,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:34,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:34,525 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2018-11-23 10:02:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,514 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 10:02:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:35,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 10:02:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-23 10:02:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-23 10:02:35,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2018-11-23 10:02:35,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,678 INFO L225 Difference]: With dead ends: 65 [2018-11-23 10:02:35,678 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 10:02:35,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 10:02:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 10:02:35,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:35,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 10:02:35,734 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 10:02:35,734 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 10:02:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,737 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 10:02:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 10:02:35,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,738 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 10:02:35,738 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 10:02:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,741 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 10:02:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 10:02:35,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:35,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 10:02:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-23 10:02:35,745 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2018-11-23 10:02:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:35,745 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-23 10:02:35,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 10:02:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 10:02:35,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:35,747 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:35,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:35,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2035030978, now seen corresponding path program 2 times [2018-11-23 10:02:35,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:35,748 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:35,777 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:35,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:35,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-23 10:02:35,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-23 10:02:35,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-23 10:02:35,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #77#return; {1456#true} is VALID [2018-11-23 10:02:35,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret9 := main(); {1456#true} is VALID [2018-11-23 10:02:35,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1456#true} is VALID [2018-11-23 10:02:35,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:35,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:35,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#true} assume !~bvslt32(~a~0, 100000bv32); {1456#true} is VALID [2018-11-23 10:02:35,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#true} havoc ~i~0;~i~0 := 0bv32; {1456#true} is VALID [2018-11-23 10:02:35,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1456#true} is VALID [2018-11-23 10:02:35,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1456#true} is VALID [2018-11-23 10:02:35,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#true} assume !~bvslt32(~i~0, 100000bv32); {1456#true} is VALID [2018-11-23 10:02:35,966 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#true} ~i~0 := 0bv32; {1554#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {1554#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1554#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {1554#(= main_~i~0 (_ bv0 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:35,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {1561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1457#false} is VALID [2018-11-23 10:02:35,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {1457#false} havoc ~x~0;~x~0 := 0bv32; {1457#false} is VALID [2018-11-23 10:02:35,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {1457#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1457#false} is VALID [2018-11-23 10:02:35,981 INFO L256 TraceCheckUtils]: 37: Hoare triple {1457#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {1457#false} is VALID [2018-11-23 10:02:35,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {1457#false} ~cond := #in~cond; {1457#false} is VALID [2018-11-23 10:02:35,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {1457#false} assume 0bv32 == ~cond; {1457#false} is VALID [2018-11-23 10:02:35,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-23 10:02:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 10:02:35,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:36,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-23 10:02:36,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {1457#false} assume 0bv32 == ~cond; {1457#false} is VALID [2018-11-23 10:02:36,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {1457#false} ~cond := #in~cond; {1457#false} is VALID [2018-11-23 10:02:36,083 INFO L256 TraceCheckUtils]: 37: Hoare triple {1457#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {1457#false} is VALID [2018-11-23 10:02:36,083 INFO L273 TraceCheckUtils]: 36: Hoare triple {1457#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1457#false} is VALID [2018-11-23 10:02:36,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {1457#false} havoc ~x~0;~x~0 := 0bv32; {1457#false} is VALID [2018-11-23 10:02:36,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {1601#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1457#false} is VALID [2018-11-23 10:02:36,084 INFO L273 TraceCheckUtils]: 33: Hoare triple {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1601#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:36,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#true} ~i~0 := 0bv32; {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#true} assume !~bvslt32(~i~0, 100000bv32); {1456#true} is VALID [2018-11-23 10:02:36,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1456#true} is VALID [2018-11-23 10:02:36,092 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1456#true} is VALID [2018-11-23 10:02:36,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#true} havoc ~i~0;~i~0 := 0bv32; {1456#true} is VALID [2018-11-23 10:02:36,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#true} assume !~bvslt32(~a~0, 100000bv32); {1456#true} is VALID [2018-11-23 10:02:36,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,096 INFO L273 TraceCheckUtils]: 12: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 10:02:36,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1456#true} is VALID [2018-11-23 10:02:36,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1456#true} is VALID [2018-11-23 10:02:36,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret9 := main(); {1456#true} is VALID [2018-11-23 10:02:36,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #77#return; {1456#true} is VALID [2018-11-23 10:02:36,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-23 10:02:36,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-23 10:02:36,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-23 10:02:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 10:02:36,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:36,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:36,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 10:02:36,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:36,183 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-23 10:02:36,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:36,185 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 6 states. [2018-11-23 10:02:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,484 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 10:02:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:36,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 10:02:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 10:02:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 10:02:36,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-23 10:02:36,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,591 INFO L225 Difference]: With dead ends: 73 [2018-11-23 10:02:36,591 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 10:02:36,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 10:02:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 10:02:36,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:36,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:36,633 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:36,634 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,636 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 10:02:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 10:02:36,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,637 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:36,637 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 10:02:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,639 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 10:02:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 10:02:36,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:36,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 10:02:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-23 10:02:36,643 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 41 [2018-11-23 10:02:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:36,643 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-23 10:02:36,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 10:02:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 10:02:36,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:36,645 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:36,645 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:36,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2090600522, now seen corresponding path program 3 times [2018-11-23 10:02:36,646 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:36,665 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:36,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 10:02:36,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:37,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {2018#true} call ULTIMATE.init(); {2018#true} is VALID [2018-11-23 10:02:37,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {2018#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2018#true} is VALID [2018-11-23 10:02:37,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {2018#true} assume true; {2018#true} is VALID [2018-11-23 10:02:37,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2018#true} {2018#true} #77#return; {2018#true} is VALID [2018-11-23 10:02:37,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {2018#true} call #t~ret9 := main(); {2018#true} is VALID [2018-11-23 10:02:37,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {2018#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2018#true} is VALID [2018-11-23 10:02:37,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,025 INFO L273 TraceCheckUtils]: 21: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,026 INFO L273 TraceCheckUtils]: 24: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,027 INFO L273 TraceCheckUtils]: 25: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,027 INFO L273 TraceCheckUtils]: 26: Hoare triple {2018#true} assume !~bvslt32(~a~0, 100000bv32); {2018#true} is VALID [2018-11-23 10:02:37,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {2018#true} havoc ~i~0;~i~0 := 0bv32; {2018#true} is VALID [2018-11-23 10:02:37,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,028 INFO L273 TraceCheckUtils]: 31: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,029 INFO L273 TraceCheckUtils]: 34: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {2018#true} assume !~bvslt32(~i~0, 100000bv32); {2018#true} is VALID [2018-11-23 10:02:37,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {2018#true} ~i~0 := 0bv32; {2134#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {2134#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2134#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {2134#(= main_~i~0 (_ bv0 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:37,034 INFO L273 TraceCheckUtils]: 40: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:37,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2148#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:37,037 INFO L273 TraceCheckUtils]: 42: Hoare triple {2148#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2148#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:37,037 INFO L273 TraceCheckUtils]: 43: Hoare triple {2148#(= (_ bv2 32) main_~i~0)} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:37,039 INFO L273 TraceCheckUtils]: 44: Hoare triple {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:37,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2162#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:37,040 INFO L273 TraceCheckUtils]: 46: Hoare triple {2162#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {2019#false} is VALID [2018-11-23 10:02:37,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {2019#false} havoc ~x~0;~x~0 := 0bv32; {2019#false} is VALID [2018-11-23 10:02:37,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {2019#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2019#false} is VALID [2018-11-23 10:02:37,040 INFO L256 TraceCheckUtils]: 49: Hoare triple {2019#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {2019#false} is VALID [2018-11-23 10:02:37,041 INFO L273 TraceCheckUtils]: 50: Hoare triple {2019#false} ~cond := #in~cond; {2019#false} is VALID [2018-11-23 10:02:37,041 INFO L273 TraceCheckUtils]: 51: Hoare triple {2019#false} assume 0bv32 == ~cond; {2019#false} is VALID [2018-11-23 10:02:37,041 INFO L273 TraceCheckUtils]: 52: Hoare triple {2019#false} assume !false; {2019#false} is VALID [2018-11-23 10:02:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 10:02:37,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:37,293 INFO L273 TraceCheckUtils]: 52: Hoare triple {2019#false} assume !false; {2019#false} is VALID [2018-11-23 10:02:37,294 INFO L273 TraceCheckUtils]: 51: Hoare triple {2019#false} assume 0bv32 == ~cond; {2019#false} is VALID [2018-11-23 10:02:37,294 INFO L273 TraceCheckUtils]: 50: Hoare triple {2019#false} ~cond := #in~cond; {2019#false} is VALID [2018-11-23 10:02:37,295 INFO L256 TraceCheckUtils]: 49: Hoare triple {2019#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {2019#false} is VALID [2018-11-23 10:02:37,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {2019#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2019#false} is VALID [2018-11-23 10:02:37,295 INFO L273 TraceCheckUtils]: 47: Hoare triple {2019#false} havoc ~x~0;~x~0 := 0bv32; {2019#false} is VALID [2018-11-23 10:02:37,296 INFO L273 TraceCheckUtils]: 46: Hoare triple {2202#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2019#false} is VALID [2018-11-23 10:02:37,298 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2202#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:37,298 INFO L273 TraceCheckUtils]: 44: Hoare triple {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {2018#true} ~i~0 := 0bv32; {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:37,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {2018#true} assume !~bvslt32(~i~0, 100000bv32); {2018#true} is VALID [2018-11-23 10:02:37,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,321 INFO L273 TraceCheckUtils]: 34: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {2018#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2018#true} is VALID [2018-11-23 10:02:37,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2018#true} is VALID [2018-11-23 10:02:37,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {2018#true} havoc ~i~0;~i~0 := 0bv32; {2018#true} is VALID [2018-11-23 10:02:37,323 INFO L273 TraceCheckUtils]: 26: Hoare triple {2018#true} assume !~bvslt32(~a~0, 100000bv32); {2018#true} is VALID [2018-11-23 10:02:37,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 10:02:37,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2018#true} is VALID [2018-11-23 10:02:37,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {2018#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2018#true} is VALID [2018-11-23 10:02:37,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {2018#true} call #t~ret9 := main(); {2018#true} is VALID [2018-11-23 10:02:37,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2018#true} {2018#true} #77#return; {2018#true} is VALID [2018-11-23 10:02:37,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {2018#true} assume true; {2018#true} is VALID [2018-11-23 10:02:37,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {2018#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2018#true} is VALID [2018-11-23 10:02:37,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {2018#true} call ULTIMATE.init(); {2018#true} is VALID [2018-11-23 10:02:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 10:02:37,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:37,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:37,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 10:02:37,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:37,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:37,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:37,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:37,406 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 12 states. [2018-11-23 10:02:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,040 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-11-23 10:02:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:39,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 10:02:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2018-11-23 10:02:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2018-11-23 10:02:39,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2018-11-23 10:02:39,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:39,415 INFO L225 Difference]: With dead ends: 103 [2018-11-23 10:02:39,416 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 10:02:39,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 10:02:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 10:02:39,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:39,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:39,485 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:39,485 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,488 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 10:02:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 10:02:39,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,489 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:39,489 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 10:02:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,492 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 10:02:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 10:02:39,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:39,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 10:02:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 10:02:39,496 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 53 [2018-11-23 10:02:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:39,497 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 10:02:39,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 10:02:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 10:02:39,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:39,498 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:39,498 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:39,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1161882210, now seen corresponding path program 4 times [2018-11-23 10:02:39,499 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:39,499 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:39,525 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:39,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:39,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:39,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:39,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 10:02:39,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2796#true} is VALID [2018-11-23 10:02:39,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 10:02:39,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #77#return; {2796#true} is VALID [2018-11-23 10:02:39,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret9 := main(); {2796#true} is VALID [2018-11-23 10:02:39,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2816#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:39,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {2816#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2816#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:39,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {2816#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2823#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:39,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {2823#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2823#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:39,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {2823#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2830#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:39,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {2830#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2830#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:39,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {2830#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2837#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:39,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {2837#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2837#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:39,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {2837#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2844#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:39,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {2844#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2844#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:39,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {2844#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2851#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:39,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {2851#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2851#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:39,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {2851#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2858#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:39,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {2858#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2858#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:39,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {2858#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2865#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:39,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {2865#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2865#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:39,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {2865#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2872#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:39,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {2872#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2872#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:39,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {2872#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2879#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:39,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {2879#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2879#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:39,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {2879#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2886#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:39,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {2886#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2797#false} is VALID [2018-11-23 10:02:39,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {2797#false} havoc ~i~0;~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 10:02:39,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,963 INFO L273 TraceCheckUtils]: 33: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,964 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:39,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:39,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 10:02:39,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {2797#false} ~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 10:02:39,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,968 INFO L273 TraceCheckUtils]: 54: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,969 INFO L273 TraceCheckUtils]: 60: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,969 INFO L273 TraceCheckUtils]: 61: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,969 INFO L273 TraceCheckUtils]: 64: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,970 INFO L273 TraceCheckUtils]: 65: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,970 INFO L273 TraceCheckUtils]: 66: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,970 INFO L273 TraceCheckUtils]: 67: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,970 INFO L273 TraceCheckUtils]: 68: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:39,970 INFO L273 TraceCheckUtils]: 69: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:39,971 INFO L273 TraceCheckUtils]: 70: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 10:02:39,971 INFO L273 TraceCheckUtils]: 71: Hoare triple {2797#false} havoc ~x~0;~x~0 := 0bv32; {2797#false} is VALID [2018-11-23 10:02:39,971 INFO L273 TraceCheckUtils]: 72: Hoare triple {2797#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2797#false} is VALID [2018-11-23 10:02:39,971 INFO L256 TraceCheckUtils]: 73: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {2797#false} is VALID [2018-11-23 10:02:39,971 INFO L273 TraceCheckUtils]: 74: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 10:02:39,972 INFO L273 TraceCheckUtils]: 75: Hoare triple {2797#false} assume 0bv32 == ~cond; {2797#false} is VALID [2018-11-23 10:02:39,972 INFO L273 TraceCheckUtils]: 76: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 10:02:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 10:02:39,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:40,633 INFO L273 TraceCheckUtils]: 76: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 10:02:40,633 INFO L273 TraceCheckUtils]: 75: Hoare triple {2797#false} assume 0bv32 == ~cond; {2797#false} is VALID [2018-11-23 10:02:40,633 INFO L273 TraceCheckUtils]: 74: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 10:02:40,634 INFO L256 TraceCheckUtils]: 73: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {2797#false} is VALID [2018-11-23 10:02:40,634 INFO L273 TraceCheckUtils]: 72: Hoare triple {2797#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2797#false} is VALID [2018-11-23 10:02:40,634 INFO L273 TraceCheckUtils]: 71: Hoare triple {2797#false} havoc ~x~0;~x~0 := 0bv32; {2797#false} is VALID [2018-11-23 10:02:40,634 INFO L273 TraceCheckUtils]: 70: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 10:02:40,634 INFO L273 TraceCheckUtils]: 69: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,635 INFO L273 TraceCheckUtils]: 66: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,635 INFO L273 TraceCheckUtils]: 65: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,635 INFO L273 TraceCheckUtils]: 64: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,635 INFO L273 TraceCheckUtils]: 63: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,635 INFO L273 TraceCheckUtils]: 62: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,635 INFO L273 TraceCheckUtils]: 61: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,636 INFO L273 TraceCheckUtils]: 59: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,636 INFO L273 TraceCheckUtils]: 58: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,636 INFO L273 TraceCheckUtils]: 57: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,636 INFO L273 TraceCheckUtils]: 56: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,636 INFO L273 TraceCheckUtils]: 54: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,637 INFO L273 TraceCheckUtils]: 52: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {2797#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2797#false} is VALID [2018-11-23 10:02:40,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2797#false} is VALID [2018-11-23 10:02:40,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {2797#false} ~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 10:02:40,637 INFO L273 TraceCheckUtils]: 48: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 10:02:40,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,638 INFO L273 TraceCheckUtils]: 45: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,638 INFO L273 TraceCheckUtils]: 43: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,639 INFO L273 TraceCheckUtils]: 38: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,639 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,639 INFO L273 TraceCheckUtils]: 33: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-23 10:02:40,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2797#false} is VALID [2018-11-23 10:02:40,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {2797#false} havoc ~i~0;~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 10:02:40,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2797#false} is VALID [2018-11-23 10:02:40,671 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3190#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:40,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:40,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret9 := main(); {2796#true} is VALID [2018-11-23 10:02:40,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #77#return; {2796#true} is VALID [2018-11-23 10:02:40,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 10:02:40,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2796#true} is VALID [2018-11-23 10:02:40,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 10:02:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 10:02:40,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:40,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:40,748 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 10:02:40,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:40,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:40,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:40,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:40,891 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 24 states. [2018-11-23 10:02:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,129 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-11-23 10:02:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:44,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 10:02:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 102 transitions. [2018-11-23 10:02:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 102 transitions. [2018-11-23 10:02:44,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 102 transitions. [2018-11-23 10:02:44,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:44,417 INFO L225 Difference]: With dead ends: 161 [2018-11-23 10:02:44,417 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 10:02:44,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 10:02:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 10:02:44,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:44,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-23 10:02:44,555 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 10:02:44,555 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 10:02:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,559 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-23 10:02:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-23 10:02:44,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,560 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 10:02:44,560 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 10:02:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:44,563 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-23 10:02:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-23 10:02:44,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:44,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:44,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:44,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 10:02:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2018-11-23 10:02:44,567 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 77 [2018-11-23 10:02:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:44,568 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-11-23 10:02:44,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-23 10:02:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 10:02:44,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:44,569 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:44,570 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:44,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:44,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1973940218, now seen corresponding path program 5 times [2018-11-23 10:02:44,570 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:44,571 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:44,593 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1