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_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:01:20,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:01:20,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:01:20,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:01:20,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:01:20,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:01:20,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:01:20,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:01:20,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:01:20,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:01:20,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:01:20,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:01:20,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:01:20,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:01:20,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:01:20,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:01:20,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:01:20,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:01:20,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:01:20,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:01:20,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:01:20,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:01:20,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:01:20,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:01:20,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:01:20,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:01:20,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:01:20,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:01:20,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:01:20,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:01:20,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:01:20,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:01:20,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:01:20,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:01:20,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:01:20,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:01:20,814 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:01:20,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:01:20,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:01:20,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:01:20,831 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:01:20,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:01:20,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:01:20,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:01:20,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:01:20,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:01:20,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:01:20,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:01:20,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:01:20,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:01:20,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:01:20,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:01:20,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:01:20,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:01:20,834 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:01:20,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:01:20,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:01:20,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:01:20,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:01:20,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:01:20,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:01:20,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:01:20,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:01:20,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:01:20,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:01:20,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:01:20,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:01:20,836 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:01:20,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:01:20,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:01:20,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:01:20,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:01:20,899 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:01:20,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_true-unreach-call_ground.i [2018-11-23 12:01:20,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/636f808d3/8f7f737bcc124ae1b80d4aad5b9e1b4b/FLAG9522dc3f4 [2018-11-23 12:01:21,436 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:01:21,437 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum2_true-unreach-call_ground.i [2018-11-23 12:01:21,446 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/636f808d3/8f7f737bcc124ae1b80d4aad5b9e1b4b/FLAG9522dc3f4 [2018-11-23 12:01:21,772 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/636f808d3/8f7f737bcc124ae1b80d4aad5b9e1b4b [2018-11-23 12:01:21,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:01:21,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:01:21,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:21,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:01:21,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:01:21,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:21" (1/1) ... [2018-11-23 12:01:21,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645f74d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:21, skipping insertion in model container [2018-11-23 12:01:21,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:21" (1/1) ... [2018-11-23 12:01:21,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:01:21,834 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:01:22,047 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:22,054 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:01:22,086 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:01:22,110 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:01:22,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22 WrapperNode [2018-11-23 12:01:22,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:01:22,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:22,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:01:22,112 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:01:22,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:01:22,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:01:22,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:01:22,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:01:22,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (1/1) ... [2018-11-23 12:01:22,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:01:22,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:01:22,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:01:22,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:01:22,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (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 12:01:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:01:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:01:22,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:01:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:01:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:01:22,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:01:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:01:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:01:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:01:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:01:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:01:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:01:22,906 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:01:22,907 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:01:22,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:22 BoogieIcfgContainer [2018-11-23 12:01:22,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:01:22,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:01:22,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:01:22,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:01:22,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:01:21" (1/3) ... [2018-11-23 12:01:22,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e24ab7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:22, skipping insertion in model container [2018-11-23 12:01:22,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:22" (2/3) ... [2018-11-23 12:01:22,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e24ab7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:22, skipping insertion in model container [2018-11-23 12:01:22,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:22" (3/3) ... [2018-11-23 12:01:22,916 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum2_true-unreach-call_ground.i [2018-11-23 12:01:22,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:01:22,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:01:22,953 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:01:22,994 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:01:22,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:01:22,995 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:01:22,995 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:01:22,996 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:01:22,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:01:22,996 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:01:22,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:01:22,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:01:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:01:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:01:23,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:23,023 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 12:01:23,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:23,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2018-11-23 12:01:23,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:23,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:23,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:01:23,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 12:01:23,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:01:23,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #76#return; {32#true} is VALID [2018-11-23 12:01:23,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-23 12:01:23,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {32#true} is VALID [2018-11-23 12:01:23,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:01:23,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:01:23,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-23 12:01:23,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {33#false} is VALID [2018-11-23 12:01:23,186 INFO L256 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {33#false} is VALID [2018-11-23 12:01:23,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:01:23,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:01:23,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:01:23,190 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 12:01:23,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:23,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:01:23,199 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:01:23,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:23,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:01:23,357 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 12:01:23,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:01:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:01:23,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:01:23,371 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:01:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:23,665 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 12:01:23,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:01:23,665 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:01:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:01:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:01:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:01:23,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 12:01:24,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:24,193 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:01:24,193 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:01:24,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 12:01:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:01:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:01:24,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:24,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:24,245 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:24,245 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:24,250 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:01:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:01:24,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:24,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:24,251 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:24,251 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:01:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:24,257 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:01:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:01:24,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:24,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:24,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:24,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:01:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 12:01:24,268 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 12:01:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:24,269 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 12:01:24,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:01:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:01:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:01:24,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:24,271 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 12:01:24,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:24,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2018-11-23 12:01:24,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:24,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:24,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:24,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:24,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {184#true} call ULTIMATE.init(); {184#true} is VALID [2018-11-23 12:01:24,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {184#true} is VALID [2018-11-23 12:01:24,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {184#true} assume true; {184#true} is VALID [2018-11-23 12:01:24,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {184#true} {184#true} #76#return; {184#true} is VALID [2018-11-23 12:01:24,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {184#true} call #t~ret6 := main(); {184#true} is VALID [2018-11-23 12:01:24,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {186#(= main_~i~0 0)} is VALID [2018-11-23 12:01:24,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {186#(= main_~i~0 0)} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 12:01:24,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {185#false} ~i~0 := 0; {185#false} is VALID [2018-11-23 12:01:24,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#false} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 12:01:24,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {185#false} ~i~0 := 0; {185#false} is VALID [2018-11-23 12:01:24,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {185#false} assume !(~i~0 < 100000); {185#false} is VALID [2018-11-23 12:01:24,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {185#false} havoc ~x~0;~x~0 := 0; {185#false} is VALID [2018-11-23 12:01:24,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {185#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {185#false} is VALID [2018-11-23 12:01:24,395 INFO L256 TraceCheckUtils]: 13: Hoare triple {185#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {185#false} is VALID [2018-11-23 12:01:24,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {185#false} ~cond := #in~cond; {185#false} is VALID [2018-11-23 12:01:24,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {185#false} assume 0 == ~cond; {185#false} is VALID [2018-11-23 12:01:24,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {185#false} assume !false; {185#false} is VALID [2018-11-23 12:01:24,397 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 12:01:24,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:01:24,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:01:24,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:01:24,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:24,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:01:24,449 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 12:01:24,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:01:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:01:24,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:01:24,451 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-23 12:01:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:24,680 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:01:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:01:24,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:01:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:01:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:01:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:01:24,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:01:25,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:25,087 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:01:25,087 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:01:25,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:01:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:01:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:01:25,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:25,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 12:01:25,111 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 12:01:25,112 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 12:01:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:25,115 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:01:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:01:25,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:25,116 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 12:01:25,116 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 12:01:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:25,119 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 12:01:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 12:01:25,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:25,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:25,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:25,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:01:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 12:01:25,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-23 12:01:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:25,124 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 12:01:25,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:01:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:01:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:01:25,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:25,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:25,125 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:25,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2018-11-23 12:01:25,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:25,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:25,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:25,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 12:01:25,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {351#true} is VALID [2018-11-23 12:01:25,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 12:01:25,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #76#return; {351#true} is VALID [2018-11-23 12:01:25,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2018-11-23 12:01:25,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {353#(= main_~i~0 0)} is VALID [2018-11-23 12:01:25,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {353#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {354#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:25,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {354#(<= main_~i~0 1)} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:25,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:25,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {352#false} is VALID [2018-11-23 12:01:25,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {352#false} is VALID [2018-11-23 12:01:25,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:25,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:25,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {352#false} is VALID [2018-11-23 12:01:25,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {352#false} is VALID [2018-11-23 12:01:25,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:25,254 INFO L273 TraceCheckUtils]: 16: Hoare triple {352#false} havoc ~x~0;~x~0 := 0; {352#false} is VALID [2018-11-23 12:01:25,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {352#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {352#false} is VALID [2018-11-23 12:01:25,254 INFO L256 TraceCheckUtils]: 18: Hoare triple {352#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {352#false} is VALID [2018-11-23 12:01:25,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 12:01:25,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {352#false} assume 0 == ~cond; {352#false} is VALID [2018-11-23 12:01:25,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 12:01:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:25,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:25,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:25,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:25,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:25,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 12:01:25,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {351#true} is VALID [2018-11-23 12:01:25,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 12:01:25,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #76#return; {351#true} is VALID [2018-11-23 12:01:25,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID [2018-11-23 12:01:25,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {373#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:25,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {354#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:25,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {354#(<= main_~i~0 1)} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:25,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:25,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {352#false} is VALID [2018-11-23 12:01:25,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {352#false} is VALID [2018-11-23 12:01:25,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:25,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#false} ~i~0 := 0; {352#false} is VALID [2018-11-23 12:01:25,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {352#false} is VALID [2018-11-23 12:01:25,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {352#false} is VALID [2018-11-23 12:01:25,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !(~i~0 < 100000); {352#false} is VALID [2018-11-23 12:01:25,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {352#false} havoc ~x~0;~x~0 := 0; {352#false} is VALID [2018-11-23 12:01:25,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {352#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {352#false} is VALID [2018-11-23 12:01:25,620 INFO L256 TraceCheckUtils]: 18: Hoare triple {352#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {352#false} is VALID [2018-11-23 12:01:25,620 INFO L273 TraceCheckUtils]: 19: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 12:01:25,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {352#false} assume 0 == ~cond; {352#false} is VALID [2018-11-23 12:01:25,621 INFO L273 TraceCheckUtils]: 21: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 12:01:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:01:25,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:25,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:01:25,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:01:25,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:25,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:01:25,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:25,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:01:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:01:25,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:01:25,728 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2018-11-23 12:01:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:26,115 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 12:01:26,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:01:26,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:01:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:01:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:01:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:01:26,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 12:01:26,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:26,359 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:01:26,359 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:01:26,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:01:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:01:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:01:26,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:26,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:01:26,399 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:01:26,400 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:01:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:26,403 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 12:01:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:01:26,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:26,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:26,404 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:01:26,404 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:01:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:26,407 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 12:01:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 12:01:26,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:26,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:26,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:26,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:01:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 12:01:26,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2018-11-23 12:01:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:26,411 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 12:01:26,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:01:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 12:01:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:01:26,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:26,413 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:26,413 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:26,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1868122094, now seen corresponding path program 2 times [2018-11-23 12:01:26,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:26,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:26,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:26,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:26,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-23 12:01:26,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-23 12:01:26,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-23 12:01:26,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #76#return; {613#true} is VALID [2018-11-23 12:01:26,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret6 := main(); {613#true} is VALID [2018-11-23 12:01:26,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {615#(= main_~i~0 0)} is VALID [2018-11-23 12:01:26,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {615#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {616#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:26,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {616#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {617#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:26,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {617#(<= main_~i~0 2)} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:26,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#false} ~i~0 := 0; {614#false} is VALID [2018-11-23 12:01:26,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {614#false} is VALID [2018-11-23 12:01:26,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {614#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {614#false} is VALID [2018-11-23 12:01:26,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {614#false} is VALID [2018-11-23 12:01:26,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {614#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {614#false} is VALID [2018-11-23 12:01:26,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {614#false} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:26,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {614#false} ~i~0 := 0; {614#false} is VALID [2018-11-23 12:01:26,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {614#false} is VALID [2018-11-23 12:01:26,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {614#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {614#false} is VALID [2018-11-23 12:01:26,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {614#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {614#false} is VALID [2018-11-23 12:01:26,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {614#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {614#false} is VALID [2018-11-23 12:01:26,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {614#false} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:26,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} havoc ~x~0;~x~0 := 0; {614#false} is VALID [2018-11-23 12:01:26,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {614#false} is VALID [2018-11-23 12:01:26,572 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {614#false} is VALID [2018-11-23 12:01:26,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-23 12:01:26,573 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2018-11-23 12:01:26,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-23 12:01:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:01:26,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:26,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:26,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:26,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:26,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:26,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:26,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-23 12:01:26,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-23 12:01:26,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-23 12:01:26,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #76#return; {613#true} is VALID [2018-11-23 12:01:26,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret6 := main(); {613#true} is VALID [2018-11-23 12:01:26,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {613#true} is VALID [2018-11-23 12:01:26,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {613#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {613#true} is VALID [2018-11-23 12:01:26,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {613#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {613#true} is VALID [2018-11-23 12:01:26,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {613#true} assume !(~i~0 < 100000); {613#true} is VALID [2018-11-23 12:01:26,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {613#true} ~i~0 := 0; {613#true} is VALID [2018-11-23 12:01:26,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {613#true} is VALID [2018-11-23 12:01:26,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {613#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {613#true} is VALID [2018-11-23 12:01:26,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {613#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {613#true} is VALID [2018-11-23 12:01:26,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {613#true} is VALID [2018-11-23 12:01:26,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {613#true} assume !(~i~0 < 100000); {613#true} is VALID [2018-11-23 12:01:26,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {613#true} ~i~0 := 0; {666#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:26,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {666#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {666#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:26,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {666#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {616#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:26,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {616#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {616#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:26,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {616#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {617#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:26,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {617#(<= main_~i~0 2)} assume !(~i~0 < 100000); {614#false} is VALID [2018-11-23 12:01:26,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} havoc ~x~0;~x~0 := 0; {614#false} is VALID [2018-11-23 12:01:26,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {614#false} is VALID [2018-11-23 12:01:26,793 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {614#false} is VALID [2018-11-23 12:01:26,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-23 12:01:26,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2018-11-23 12:01:26,794 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-23 12:01:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:01:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:01:26,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:01:26,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:26,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:01:26,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:26,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:01:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:01:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:01:26,870 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2018-11-23 12:01:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:27,067 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:01:27,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:01:27,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:01:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:01:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:01:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:01:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:01:27,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 12:01:27,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:27,226 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:01:27,226 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:01:27,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:01:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:01:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:01:27,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:27,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:01:27,247 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:01:27,247 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:01:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:27,250 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:01:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 12:01:27,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:27,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:27,251 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:01:27,252 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:01:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:27,254 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:01:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 12:01:27,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:27,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:27,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:27,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:01:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 12:01:27,258 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2018-11-23 12:01:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:27,258 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 12:01:27,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:01:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:01:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:01:27,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:27,260 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:27,260 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:27,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash 150752210, now seen corresponding path program 3 times [2018-11-23 12:01:27,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:27,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:27,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:27,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-23 12:01:27,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {923#true} is VALID [2018-11-23 12:01:27,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-23 12:01:27,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #76#return; {923#true} is VALID [2018-11-23 12:01:27,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret6 := main(); {923#true} is VALID [2018-11-23 12:01:27,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {925#(= main_~i~0 0)} is VALID [2018-11-23 12:01:27,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {925#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {926#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:27,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {927#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:27,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {928#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:27,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(<= main_~i~0 3)} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:27,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:27,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 12:01:27,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 12:01:27,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 12:01:27,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 12:01:27,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 12:01:27,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 12:01:27,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:27,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:27,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 12:01:27,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 12:01:27,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 12:01:27,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 12:01:27,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 12:01:27,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 12:01:27,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:27,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {924#false} havoc ~x~0;~x~0 := 0; {924#false} is VALID [2018-11-23 12:01:27,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {924#false} is VALID [2018-11-23 12:01:27,410 INFO L256 TraceCheckUtils]: 28: Hoare triple {924#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {924#false} is VALID [2018-11-23 12:01:27,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-23 12:01:27,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {924#false} assume 0 == ~cond; {924#false} is VALID [2018-11-23 12:01:27,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-23 12:01:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:01:27,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:27,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:27,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:27,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:01:27,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:27,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:27,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-23 12:01:27,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {923#true} is VALID [2018-11-23 12:01:27,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-23 12:01:27,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #76#return; {923#true} is VALID [2018-11-23 12:01:27,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret6 := main(); {923#true} is VALID [2018-11-23 12:01:27,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {947#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:27,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {947#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {926#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:27,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {927#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:27,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {928#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:27,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(<= main_~i~0 3)} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:27,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:27,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 12:01:27,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 12:01:27,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 12:01:27,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 12:01:27,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {924#false} is VALID [2018-11-23 12:01:27,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {924#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {924#false} is VALID [2018-11-23 12:01:27,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:27,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {924#false} ~i~0 := 0; {924#false} is VALID [2018-11-23 12:01:27,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 12:01:27,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 12:01:27,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 12:01:27,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 12:01:27,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {924#false} is VALID [2018-11-23 12:01:27,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {924#false} is VALID [2018-11-23 12:01:27,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(~i~0 < 100000); {924#false} is VALID [2018-11-23 12:01:27,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {924#false} havoc ~x~0;~x~0 := 0; {924#false} is VALID [2018-11-23 12:01:27,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {924#false} is VALID [2018-11-23 12:01:27,587 INFO L256 TraceCheckUtils]: 28: Hoare triple {924#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {924#false} is VALID [2018-11-23 12:01:27,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-23 12:01:27,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {924#false} assume 0 == ~cond; {924#false} is VALID [2018-11-23 12:01:27,588 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-23 12:01:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:01:27,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:27,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:01:27,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 12:01:27,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:27,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:01:27,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:27,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:01:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:01:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:01:27,647 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2018-11-23 12:01:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:27,917 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-23 12:01:27,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:01:27,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-23 12:01:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:01:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:01:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:01:27,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-23 12:01:28,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:28,096 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:01:28,096 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:01:28,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:01:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:01:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 12:01:28,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:28,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 12:01:28,117 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 12:01:28,118 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 12:01:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:28,121 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 12:01:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 12:01:28,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:28,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:28,122 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 12:01:28,122 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 12:01:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:28,125 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 12:01:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 12:01:28,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:28,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:28,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:28,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:01:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 12:01:28,128 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2018-11-23 12:01:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:28,129 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 12:01:28,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:01:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 12:01:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:01:28,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:28,130 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:28,131 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:28,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 4 times [2018-11-23 12:01:28,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:28,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:28,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:28,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:28,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {1281#true} call ULTIMATE.init(); {1281#true} is VALID [2018-11-23 12:01:28,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {1281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1281#true} is VALID [2018-11-23 12:01:28,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {1281#true} assume true; {1281#true} is VALID [2018-11-23 12:01:28,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} #76#return; {1281#true} is VALID [2018-11-23 12:01:28,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {1281#true} call #t~ret6 := main(); {1281#true} is VALID [2018-11-23 12:01:28,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {1281#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1283#(= main_~i~0 0)} is VALID [2018-11-23 12:01:28,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {1283#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:28,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:28,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {1285#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:28,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1287#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:28,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {1287#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:28,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 12:01:28,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 12:01:28,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 12:01:28,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 12:01:28,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 12:01:28,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 12:01:28,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 12:01:28,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1282#false} is VALID [2018-11-23 12:01:28,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {1282#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1282#false} is VALID [2018-11-23 12:01:28,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:28,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 12:01:28,351 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,351 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,352 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,352 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,352 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,353 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:28,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#false} havoc ~x~0;~x~0 := 0; {1282#false} is VALID [2018-11-23 12:01:28,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {1282#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1282#false} is VALID [2018-11-23 12:01:28,354 INFO L256 TraceCheckUtils]: 33: Hoare triple {1282#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1282#false} is VALID [2018-11-23 12:01:28,354 INFO L273 TraceCheckUtils]: 34: Hoare triple {1282#false} ~cond := #in~cond; {1282#false} is VALID [2018-11-23 12:01:28,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {1282#false} assume 0 == ~cond; {1282#false} is VALID [2018-11-23 12:01:28,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2018-11-23 12:01:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 12:01:28,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:28,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:28,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:28,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:28,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:28,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:28,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {1281#true} call ULTIMATE.init(); {1281#true} is VALID [2018-11-23 12:01:28,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {1281#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1281#true} is VALID [2018-11-23 12:01:28,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {1281#true} assume true; {1281#true} is VALID [2018-11-23 12:01:28,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} #76#return; {1281#true} is VALID [2018-11-23 12:01:28,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {1281#true} call #t~ret6 := main(); {1281#true} is VALID [2018-11-23 12:01:28,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {1281#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1281#true} is VALID [2018-11-23 12:01:28,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:28,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:28,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:28,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {1281#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1281#true} is VALID [2018-11-23 12:01:28,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {1281#true} assume !(~i~0 < 100000); {1281#true} is VALID [2018-11-23 12:01:28,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {1281#true} ~i~0 := 0; {1324#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:28,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {1324#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1324#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:28,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {1324#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:28,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {1284#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:28,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {1284#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:28,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {1285#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1285#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:28,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {1285#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:28,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {1286#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1286#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:28,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1287#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:28,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {1287#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:28,671 INFO L273 TraceCheckUtils]: 21: Hoare triple {1282#false} ~i~0 := 0; {1282#false} is VALID [2018-11-23 12:01:28,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,673 INFO L273 TraceCheckUtils]: 27: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {1282#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1282#false} is VALID [2018-11-23 12:01:28,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {1282#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1282#false} is VALID [2018-11-23 12:01:28,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {1282#false} assume !(~i~0 < 100000); {1282#false} is VALID [2018-11-23 12:01:28,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {1282#false} havoc ~x~0;~x~0 := 0; {1282#false} is VALID [2018-11-23 12:01:28,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {1282#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1282#false} is VALID [2018-11-23 12:01:28,675 INFO L256 TraceCheckUtils]: 33: Hoare triple {1282#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1282#false} is VALID [2018-11-23 12:01:28,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {1282#false} ~cond := #in~cond; {1282#false} is VALID [2018-11-23 12:01:28,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {1282#false} assume 0 == ~cond; {1282#false} is VALID [2018-11-23 12:01:28,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {1282#false} assume !false; {1282#false} is VALID [2018-11-23 12:01:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 12:01:28,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:28,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:01:28,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 12:01:28,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:28,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:01:28,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:28,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:01:28,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:01:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:28,757 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2018-11-23 12:01:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:29,044 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 12:01:29,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:01:29,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 12:01:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 12:01:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:01:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 12:01:29,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-23 12:01:29,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:29,159 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:01:29,160 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:01:29,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:01:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:01:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:01:29,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:29,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:01:29,203 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:01:29,204 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:01:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:29,206 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 12:01:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 12:01:29,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:29,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:29,207 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:01:29,208 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:01:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:29,210 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 12:01:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 12:01:29,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:29,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:29,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:29,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:01:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-23 12:01:29,213 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2018-11-23 12:01:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:29,214 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-23 12:01:29,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:01:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-23 12:01:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:01:29,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:29,215 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:29,216 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:29,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1558523702, now seen corresponding path program 5 times [2018-11-23 12:01:29,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:29,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:29,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:29,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 12:01:29,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 12:01:29,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 12:01:29,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #76#return; {1687#true} is VALID [2018-11-23 12:01:29,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret6 := main(); {1687#true} is VALID [2018-11-23 12:01:29,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1689#(= main_~i~0 0)} is VALID [2018-11-23 12:01:29,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:29,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:29,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:29,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {1692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:29,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 12:01:29,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 12:01:29,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1688#false} is VALID [2018-11-23 12:01:29,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 12:01:29,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 12:01:29,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 12:01:29,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 12:01:29,503 INFO L273 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 12:01:29,503 INFO L273 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 12:01:29,504 INFO L273 TraceCheckUtils]: 32: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 12:01:29,504 INFO L273 TraceCheckUtils]: 33: Hoare triple {1688#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1688#false} is VALID [2018-11-23 12:01:29,504 INFO L273 TraceCheckUtils]: 34: Hoare triple {1688#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1688#false} is VALID [2018-11-23 12:01:29,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:01:29,505 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 12:01:29,505 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 12:01:29,505 INFO L256 TraceCheckUtils]: 38: Hoare triple {1688#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1688#false} is VALID [2018-11-23 12:01:29,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 12:01:29,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 12:01:29,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 12:01:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 12:01:29,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:29,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:29,523 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:29,986 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:01:29,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:30,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:30,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 12:01:30,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 12:01:30,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 12:01:30,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #76#return; {1687#true} is VALID [2018-11-23 12:01:30,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret6 := main(); {1687#true} is VALID [2018-11-23 12:01:30,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1687#true} is VALID [2018-11-23 12:01:30,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:01:30,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:01:30,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:01:30,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:01:30,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:01:30,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 12:01:30,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {1687#true} ~i~0 := 0; {1687#true} is VALID [2018-11-23 12:01:30,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 12:01:30,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 12:01:30,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 12:01:30,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 12:01:30,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 12:01:30,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 12:01:30,152 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 12:01:30,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 12:01:30,153 INFO L273 TraceCheckUtils]: 21: Hoare triple {1687#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {1687#true} is VALID [2018-11-23 12:01:30,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {1687#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#true} is VALID [2018-11-23 12:01:30,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 12:01:30,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#true} ~i~0 := 0; {1770#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:30,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {1770#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1770#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:30,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {1770#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:30,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:30,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {1690#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:30,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:30,157 INFO L273 TraceCheckUtils]: 30: Hoare triple {1691#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:30,157 INFO L273 TraceCheckUtils]: 31: Hoare triple {1692#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:30,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {1692#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:30,159 INFO L273 TraceCheckUtils]: 33: Hoare triple {1693#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:30,160 INFO L273 TraceCheckUtils]: 34: Hoare triple {1693#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:30,161 INFO L273 TraceCheckUtils]: 35: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:01:30,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 12:01:30,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 12:01:30,162 INFO L256 TraceCheckUtils]: 38: Hoare triple {1688#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1688#false} is VALID [2018-11-23 12:01:30,162 INFO L273 TraceCheckUtils]: 39: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 12:01:30,162 INFO L273 TraceCheckUtils]: 40: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 12:01:30,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 12:01:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:01:30,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:30,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:01:30,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 12:01:30,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:30,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:01:30,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:30,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:01:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:01:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:01:30,274 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2018-11-23 12:01:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:30,856 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-23 12:01:30,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:01:30,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 12:01:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:01:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 12:01:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:01:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-23 12:01:30,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-23 12:01:31,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:31,031 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:01:31,031 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:01:31,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:01:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:01:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 12:01:31,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:31,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-23 12:01:31,065 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-23 12:01:31,066 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-23 12:01:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:31,068 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-23 12:01:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-23 12:01:31,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:31,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:31,069 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-23 12:01:31,069 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-23 12:01:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:31,071 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-23 12:01:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-23 12:01:31,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:31,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:31,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:31,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:01:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 12:01:31,074 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 42 [2018-11-23 12:01:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:31,075 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 12:01:31,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:01:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 12:01:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:01:31,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:31,076 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:31,077 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:31,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:31,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1349350398, now seen corresponding path program 6 times [2018-11-23 12:01:31,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:31,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:31,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:31,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:31,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 12:01:31,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 12:01:31,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 12:01:31,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #76#return; {2141#true} is VALID [2018-11-23 12:01:31,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret6 := main(); {2141#true} is VALID [2018-11-23 12:01:31,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2143#(= main_~i~0 0)} is VALID [2018-11-23 12:01:31,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:31,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {2144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:31,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {2145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:31,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {2146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:31,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:31,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {2148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2149#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:31,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {2149#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:31,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:31,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 12:01:31,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 12:01:31,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 12:01:31,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 12:01:31,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 12:01:31,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 12:01:31,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 12:01:31,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 12:01:31,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 12:01:31,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 12:01:31,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2142#false} is VALID [2018-11-23 12:01:31,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {2142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2142#false} is VALID [2018-11-23 12:01:31,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:31,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {2142#false} ~i~0 := 0; {2142#false} is VALID [2018-11-23 12:01:31,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:31,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:31,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:31,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:31,410 INFO L273 TraceCheckUtils]: 32: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:31,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:31,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:31,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:31,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:31,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:31,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {2142#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2142#false} is VALID [2018-11-23 12:01:31,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {2142#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2142#false} is VALID [2018-11-23 12:01:31,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {2142#false} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:31,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 12:01:31,413 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 12:01:31,413 INFO L256 TraceCheckUtils]: 43: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2142#false} is VALID [2018-11-23 12:01:31,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 12:01:31,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 12:01:31,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 12:01:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 12:01:31,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:31,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:31,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:01:31,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:01:31,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:31,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:31,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {2141#true} call ULTIMATE.init(); {2141#true} is VALID [2018-11-23 12:01:31,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {2141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2141#true} is VALID [2018-11-23 12:01:31,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {2141#true} assume true; {2141#true} is VALID [2018-11-23 12:01:31,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2141#true} {2141#true} #76#return; {2141#true} is VALID [2018-11-23 12:01:31,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {2141#true} call #t~ret6 := main(); {2141#true} is VALID [2018-11-23 12:01:31,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {2141#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2141#true} is VALID [2018-11-23 12:01:31,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:01:31,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:01:31,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:01:31,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:01:31,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:01:31,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {2141#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2141#true} is VALID [2018-11-23 12:01:31,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 12:01:31,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {2141#true} ~i~0 := 0; {2141#true} is VALID [2018-11-23 12:01:31,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 12:01:31,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:31,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 12:01:31,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:31,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 12:01:31,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:31,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 12:01:31,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:31,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 12:01:31,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:31,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {2141#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2141#true} is VALID [2018-11-23 12:01:31,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {2141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2141#true} is VALID [2018-11-23 12:01:31,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {2141#true} assume !(~i~0 < 100000); {2141#true} is VALID [2018-11-23 12:01:31,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {2141#true} ~i~0 := 0; {2234#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:31,817 INFO L273 TraceCheckUtils]: 28: Hoare triple {2234#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2234#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:31,831 INFO L273 TraceCheckUtils]: 29: Hoare triple {2234#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:31,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {2144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2144#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:31,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {2144#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:31,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {2145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2145#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:31,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {2145#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:31,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {2146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2146#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:31,861 INFO L273 TraceCheckUtils]: 35: Hoare triple {2146#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:31,861 INFO L273 TraceCheckUtils]: 36: Hoare triple {2147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2147#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:31,861 INFO L273 TraceCheckUtils]: 37: Hoare triple {2147#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:31,862 INFO L273 TraceCheckUtils]: 38: Hoare triple {2148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2148#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:31,862 INFO L273 TraceCheckUtils]: 39: Hoare triple {2148#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2149#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:31,863 INFO L273 TraceCheckUtils]: 40: Hoare triple {2149#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2142#false} is VALID [2018-11-23 12:01:31,863 INFO L273 TraceCheckUtils]: 41: Hoare triple {2142#false} havoc ~x~0;~x~0 := 0; {2142#false} is VALID [2018-11-23 12:01:31,863 INFO L273 TraceCheckUtils]: 42: Hoare triple {2142#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2142#false} is VALID [2018-11-23 12:01:31,863 INFO L256 TraceCheckUtils]: 43: Hoare triple {2142#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2142#false} is VALID [2018-11-23 12:01:31,863 INFO L273 TraceCheckUtils]: 44: Hoare triple {2142#false} ~cond := #in~cond; {2142#false} is VALID [2018-11-23 12:01:31,863 INFO L273 TraceCheckUtils]: 45: Hoare triple {2142#false} assume 0 == ~cond; {2142#false} is VALID [2018-11-23 12:01:31,864 INFO L273 TraceCheckUtils]: 46: Hoare triple {2142#false} assume !false; {2142#false} is VALID [2018-11-23 12:01:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:01:31,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:31,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:01:31,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 12:01:31,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:31,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:01:31,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:31,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:01:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:01:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:01:31,959 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2018-11-23 12:01:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:32,402 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-23 12:01:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:01:32,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 12:01:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:01:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2018-11-23 12:01:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:01:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2018-11-23 12:01:32,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 84 transitions. [2018-11-23 12:01:32,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:32,504 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:01:32,504 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:01:32,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:01:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:01:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 12:01:32,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:32,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 12:01:32,533 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 12:01:32,533 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 12:01:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:32,536 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 12:01:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 12:01:32,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:32,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:32,537 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 12:01:32,537 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 12:01:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:32,538 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-23 12:01:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-23 12:01:32,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:32,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:32,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:32,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:01:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-11-23 12:01:32,541 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 47 [2018-11-23 12:01:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:32,541 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-11-23 12:01:32,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:01:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 12:01:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:01:32,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:32,542 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:32,543 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:32,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1128841790, now seen corresponding path program 7 times [2018-11-23 12:01:32,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:32,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:32,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:32,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:32,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {2643#true} call ULTIMATE.init(); {2643#true} is VALID [2018-11-23 12:01:32,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {2643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2643#true} is VALID [2018-11-23 12:01:32,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2018-11-23 12:01:32,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2643#true} #76#return; {2643#true} is VALID [2018-11-23 12:01:32,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {2643#true} call #t~ret6 := main(); {2643#true} is VALID [2018-11-23 12:01:32,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {2643#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2645#(= main_~i~0 0)} is VALID [2018-11-23 12:01:32,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {2645#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2646#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:32,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {2646#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2647#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:32,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {2647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2648#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:32,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2649#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:32,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {2649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2650#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:32,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {2650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2651#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:32,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {2651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:32,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:01:32,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:01:32,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:32,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:32,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:32,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:32,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:32,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:32,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:32,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:32,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:32,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:32,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:32,809 INFO L273 TraceCheckUtils]: 26: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:32,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:32,809 INFO L273 TraceCheckUtils]: 28: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:32,809 INFO L273 TraceCheckUtils]: 29: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:01:32,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:01:32,810 INFO L273 TraceCheckUtils]: 31: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:32,810 INFO L273 TraceCheckUtils]: 32: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:32,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:32,811 INFO L273 TraceCheckUtils]: 34: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:32,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:32,811 INFO L273 TraceCheckUtils]: 36: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:32,811 INFO L273 TraceCheckUtils]: 37: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:32,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:32,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:32,812 INFO L273 TraceCheckUtils]: 40: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:32,812 INFO L273 TraceCheckUtils]: 41: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:32,812 INFO L273 TraceCheckUtils]: 42: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:32,813 INFO L273 TraceCheckUtils]: 43: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:32,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:32,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:01:32,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {2644#false} havoc ~x~0;~x~0 := 0; {2644#false} is VALID [2018-11-23 12:01:32,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {2644#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2644#false} is VALID [2018-11-23 12:01:32,814 INFO L256 TraceCheckUtils]: 48: Hoare triple {2644#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2644#false} is VALID [2018-11-23 12:01:32,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {2644#false} ~cond := #in~cond; {2644#false} is VALID [2018-11-23 12:01:32,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {2644#false} assume 0 == ~cond; {2644#false} is VALID [2018-11-23 12:01:32,814 INFO L273 TraceCheckUtils]: 51: Hoare triple {2644#false} assume !false; {2644#false} is VALID [2018-11-23 12:01:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 12:01:32,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:32,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:32,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:32,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:33,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {2643#true} call ULTIMATE.init(); {2643#true} is VALID [2018-11-23 12:01:33,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {2643#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2643#true} is VALID [2018-11-23 12:01:33,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2018-11-23 12:01:33,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2643#true} #76#return; {2643#true} is VALID [2018-11-23 12:01:33,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {2643#true} call #t~ret6 := main(); {2643#true} is VALID [2018-11-23 12:01:33,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {2643#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2671#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:33,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {2671#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2646#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:33,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {2646#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2647#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:33,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {2647#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2648#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:33,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2649#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:33,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {2649#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2650#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:33,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {2650#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2651#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:33,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {2651#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2652#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:33,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:01:33,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:01:33,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:33,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:33,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:33,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:33,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:33,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 27: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {2644#false} is VALID [2018-11-23 12:01:33,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {2644#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {2644#false} ~i~0 := 0; {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 31: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:33,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 38: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 41: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 42: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {2644#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {2644#false} is VALID [2018-11-23 12:01:33,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {2644#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2644#false} is VALID [2018-11-23 12:01:33,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {2644#false} assume !(~i~0 < 100000); {2644#false} is VALID [2018-11-23 12:01:33,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {2644#false} havoc ~x~0;~x~0 := 0; {2644#false} is VALID [2018-11-23 12:01:33,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {2644#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {2644#false} is VALID [2018-11-23 12:01:33,099 INFO L256 TraceCheckUtils]: 48: Hoare triple {2644#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2644#false} is VALID [2018-11-23 12:01:33,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {2644#false} ~cond := #in~cond; {2644#false} is VALID [2018-11-23 12:01:33,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {2644#false} assume 0 == ~cond; {2644#false} is VALID [2018-11-23 12:01:33,099 INFO L273 TraceCheckUtils]: 51: Hoare triple {2644#false} assume !false; {2644#false} is VALID [2018-11-23 12:01:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 12:01:33,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:33,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:01:33,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 12:01:33,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:33,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:01:33,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:33,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:01:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:01:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:01:33,145 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 11 states. [2018-11-23 12:01:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:33,712 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-11-23 12:01:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:01:33,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 12:01:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:01:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 12:01:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:01:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 12:01:33,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 89 transitions. [2018-11-23 12:01:33,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:33,867 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:01:33,867 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:01:33,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:01:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:01:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-23 12:01:33,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:33,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-23 12:01:33,898 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-23 12:01:33,898 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-23 12:01:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:33,900 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:01:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 12:01:33,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:33,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:33,901 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-23 12:01:33,901 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-23 12:01:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:33,903 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:01:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-23 12:01:33,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:33,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:33,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:33,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:01:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-11-23 12:01:33,906 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 52 [2018-11-23 12:01:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:33,906 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-11-23 12:01:33,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:01:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-23 12:01:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:01:33,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:33,908 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:33,908 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:33,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash -612503046, now seen corresponding path program 8 times [2018-11-23 12:01:33,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:33,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:34,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {3193#true} call ULTIMATE.init(); {3193#true} is VALID [2018-11-23 12:01:34,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {3193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3193#true} is VALID [2018-11-23 12:01:34,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {3193#true} assume true; {3193#true} is VALID [2018-11-23 12:01:34,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3193#true} {3193#true} #76#return; {3193#true} is VALID [2018-11-23 12:01:34,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {3193#true} call #t~ret6 := main(); {3193#true} is VALID [2018-11-23 12:01:34,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {3193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3195#(= main_~i~0 0)} is VALID [2018-11-23 12:01:34,201 INFO L273 TraceCheckUtils]: 6: Hoare triple {3195#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:34,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {3196#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3197#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:34,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {3197#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:34,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:34,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {3199#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:34,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {3200#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:34,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {3201#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:34,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {3202#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:34,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {3203#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:01:34,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:01:34,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,209 INFO L273 TraceCheckUtils]: 22: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,210 INFO L273 TraceCheckUtils]: 29: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:01:34,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:01:34,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 41: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,213 INFO L273 TraceCheckUtils]: 43: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,214 INFO L273 TraceCheckUtils]: 50: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:01:34,214 INFO L273 TraceCheckUtils]: 51: Hoare triple {3194#false} havoc ~x~0;~x~0 := 0; {3194#false} is VALID [2018-11-23 12:01:34,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {3194#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3194#false} is VALID [2018-11-23 12:01:34,214 INFO L256 TraceCheckUtils]: 53: Hoare triple {3194#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3194#false} is VALID [2018-11-23 12:01:34,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#false} ~cond := #in~cond; {3194#false} is VALID [2018-11-23 12:01:34,215 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#false} assume 0 == ~cond; {3194#false} is VALID [2018-11-23 12:01:34,215 INFO L273 TraceCheckUtils]: 56: Hoare triple {3194#false} assume !false; {3194#false} is VALID [2018-11-23 12:01:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 12:01:34,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:34,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:34,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:01:34,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:01:34,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:34,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:34,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {3193#true} call ULTIMATE.init(); {3193#true} is VALID [2018-11-23 12:01:34,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {3193#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3193#true} is VALID [2018-11-23 12:01:34,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {3193#true} assume true; {3193#true} is VALID [2018-11-23 12:01:34,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3193#true} {3193#true} #76#return; {3193#true} is VALID [2018-11-23 12:01:34,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {3193#true} call #t~ret6 := main(); {3193#true} is VALID [2018-11-23 12:01:34,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {3193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3222#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:34,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {3222#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3196#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:34,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {3196#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3197#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:34,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {3197#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3198#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:34,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3199#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:34,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {3199#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3200#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:34,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {3200#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3201#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:34,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {3201#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3202#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:34,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {3202#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3203#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:34,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {3203#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:01:34,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:01:34,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,488 INFO L273 TraceCheckUtils]: 26: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,488 INFO L273 TraceCheckUtils]: 30: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3194#false} is VALID [2018-11-23 12:01:34,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {3194#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3194#false} is VALID [2018-11-23 12:01:34,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:01:34,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {3194#false} ~i~0 := 0; {3194#false} is VALID [2018-11-23 12:01:34,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,489 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,489 INFO L273 TraceCheckUtils]: 37: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,489 INFO L273 TraceCheckUtils]: 38: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 39: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 40: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 41: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 44: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,490 INFO L273 TraceCheckUtils]: 46: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L273 TraceCheckUtils]: 47: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L273 TraceCheckUtils]: 48: Hoare triple {3194#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L273 TraceCheckUtils]: 49: Hoare triple {3194#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L273 TraceCheckUtils]: 50: Hoare triple {3194#false} assume !(~i~0 < 100000); {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L273 TraceCheckUtils]: 51: Hoare triple {3194#false} havoc ~x~0;~x~0 := 0; {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L273 TraceCheckUtils]: 52: Hoare triple {3194#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L256 TraceCheckUtils]: 53: Hoare triple {3194#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3194#false} is VALID [2018-11-23 12:01:34,491 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#false} ~cond := #in~cond; {3194#false} is VALID [2018-11-23 12:01:34,492 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#false} assume 0 == ~cond; {3194#false} is VALID [2018-11-23 12:01:34,492 INFO L273 TraceCheckUtils]: 56: Hoare triple {3194#false} assume !false; {3194#false} is VALID [2018-11-23 12:01:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-23 12:01:34,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:34,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:01:34,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-23 12:01:34,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:34,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:01:34,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:01:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:01:34,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:34,578 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 12 states. [2018-11-23 12:01:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:34,869 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-23 12:01:34,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:01:34,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-23 12:01:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-23 12:01:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:01:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2018-11-23 12:01:34,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 94 transitions. [2018-11-23 12:01:35,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:35,013 INFO L225 Difference]: With dead ends: 116 [2018-11-23 12:01:35,013 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:01:35,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:01:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:01:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:01:35,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:35,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:01:35,050 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:01:35,050 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:01:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:35,052 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 12:01:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 12:01:35,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:35,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:35,053 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:01:35,053 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:01:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:35,055 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 12:01:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-23 12:01:35,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:35,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:35,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:35,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:01:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-23 12:01:35,058 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 57 [2018-11-23 12:01:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:35,058 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-23 12:01:35,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:01:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-23 12:01:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:01:35,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:35,060 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:35,060 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:35,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash -490630470, now seen corresponding path program 9 times [2018-11-23 12:01:35,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:35,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:35,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:35,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:35,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:35,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {3791#true} call ULTIMATE.init(); {3791#true} is VALID [2018-11-23 12:01:35,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {3791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3791#true} is VALID [2018-11-23 12:01:35,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {3791#true} assume true; {3791#true} is VALID [2018-11-23 12:01:35,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3791#true} {3791#true} #76#return; {3791#true} is VALID [2018-11-23 12:01:35,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {3791#true} call #t~ret6 := main(); {3791#true} is VALID [2018-11-23 12:01:35,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {3791#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3793#(= main_~i~0 0)} is VALID [2018-11-23 12:01:35,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {3793#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3794#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:35,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {3794#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3795#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:35,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {3795#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3796#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:35,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3797#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:35,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {3797#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3798#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:35,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {3798#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3799#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:35,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {3799#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3800#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:35,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {3800#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3801#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:35,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {3801#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3802#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:35,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {3802#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 20: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 44: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 45: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 46: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,369 INFO L273 TraceCheckUtils]: 47: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 48: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 49: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 50: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 51: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 54: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,370 INFO L273 TraceCheckUtils]: 55: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:01:35,371 INFO L273 TraceCheckUtils]: 56: Hoare triple {3792#false} havoc ~x~0;~x~0 := 0; {3792#false} is VALID [2018-11-23 12:01:35,371 INFO L273 TraceCheckUtils]: 57: Hoare triple {3792#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3792#false} is VALID [2018-11-23 12:01:35,371 INFO L256 TraceCheckUtils]: 58: Hoare triple {3792#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3792#false} is VALID [2018-11-23 12:01:35,371 INFO L273 TraceCheckUtils]: 59: Hoare triple {3792#false} ~cond := #in~cond; {3792#false} is VALID [2018-11-23 12:01:35,371 INFO L273 TraceCheckUtils]: 60: Hoare triple {3792#false} assume 0 == ~cond; {3792#false} is VALID [2018-11-23 12:01:35,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2018-11-23 12:01:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 12:01:35,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:35,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:35,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:01:35,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:01:35,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:35,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:35,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {3791#true} call ULTIMATE.init(); {3791#true} is VALID [2018-11-23 12:01:35,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {3791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3791#true} is VALID [2018-11-23 12:01:35,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {3791#true} assume true; {3791#true} is VALID [2018-11-23 12:01:35,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3791#true} {3791#true} #76#return; {3791#true} is VALID [2018-11-23 12:01:35,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {3791#true} call #t~ret6 := main(); {3791#true} is VALID [2018-11-23 12:01:35,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {3791#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3821#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:35,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {3821#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3794#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:35,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {3794#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3795#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:35,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {3795#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3796#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:35,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3797#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:35,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {3797#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3798#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:35,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {3798#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3799#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:35,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {3799#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3800#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:35,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {3800#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3801#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:35,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {3801#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3802#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:35,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {3802#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:01:35,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:01:35,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {3792#false} is VALID [2018-11-23 12:01:35,884 INFO L273 TraceCheckUtils]: 34: Hoare triple {3792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3792#false} is VALID [2018-11-23 12:01:35,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:01:35,884 INFO L273 TraceCheckUtils]: 36: Hoare triple {3792#false} ~i~0 := 0; {3792#false} is VALID [2018-11-23 12:01:35,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 42: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 44: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,886 INFO L273 TraceCheckUtils]: 50: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {3792#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {3792#false} is VALID [2018-11-23 12:01:35,887 INFO L273 TraceCheckUtils]: 54: Hoare triple {3792#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3792#false} is VALID [2018-11-23 12:01:35,887 INFO L273 TraceCheckUtils]: 55: Hoare triple {3792#false} assume !(~i~0 < 100000); {3792#false} is VALID [2018-11-23 12:01:35,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {3792#false} havoc ~x~0;~x~0 := 0; {3792#false} is VALID [2018-11-23 12:01:35,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {3792#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {3792#false} is VALID [2018-11-23 12:01:35,888 INFO L256 TraceCheckUtils]: 58: Hoare triple {3792#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3792#false} is VALID [2018-11-23 12:01:35,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {3792#false} ~cond := #in~cond; {3792#false} is VALID [2018-11-23 12:01:35,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {3792#false} assume 0 == ~cond; {3792#false} is VALID [2018-11-23 12:01:35,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2018-11-23 12:01:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-23 12:01:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:35,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:01:35,921 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 12:01:35,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:35,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:01:36,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:36,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:01:36,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:01:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:01:36,019 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 13 states. [2018-11-23 12:01:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,520 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-23 12:01:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:01:36,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-23 12:01:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:01:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-23 12:01:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:01:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2018-11-23 12:01:36,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2018-11-23 12:01:36,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:36,678 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:01:36,678 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:01:36,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:01:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:01:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 12:01:36,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:36,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 12:01:36,779 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 12:01:36,779 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 12:01:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,781 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 12:01:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 12:01:36,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:36,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:36,782 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 12:01:36,782 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 12:01:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:36,783 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-23 12:01:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-23 12:01:36,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:36,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:36,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:36,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:01:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-11-23 12:01:36,786 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 62 [2018-11-23 12:01:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:36,786 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-11-23 12:01:36,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:01:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 12:01:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:01:36,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:36,787 INFO L402 BasicCegarLoop]: trace histogram [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 12:01:36,788 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:36,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 10 times [2018-11-23 12:01:36,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:36,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:36,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:37,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {4437#true} call ULTIMATE.init(); {4437#true} is VALID [2018-11-23 12:01:37,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {4437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4437#true} is VALID [2018-11-23 12:01:37,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {4437#true} assume true; {4437#true} is VALID [2018-11-23 12:01:37,032 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4437#true} {4437#true} #76#return; {4437#true} is VALID [2018-11-23 12:01:37,032 INFO L256 TraceCheckUtils]: 4: Hoare triple {4437#true} call #t~ret6 := main(); {4437#true} is VALID [2018-11-23 12:01:37,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {4437#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4439#(= main_~i~0 0)} is VALID [2018-11-23 12:01:37,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {4439#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {4440#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {4441#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {4442#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {4443#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {4444#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {4446#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {4447#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {4448#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4449#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:37,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {4449#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:01:37,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 12:01:37,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,044 INFO L273 TraceCheckUtils]: 24: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 33: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 34: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 35: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 36: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4438#false} is VALID [2018-11-23 12:01:37,046 INFO L273 TraceCheckUtils]: 37: Hoare triple {4438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 38: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 43: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 44: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,047 INFO L273 TraceCheckUtils]: 46: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 47: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 48: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 51: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 52: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 57: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 58: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 59: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 60: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {4438#false} havoc ~x~0;~x~0 := 0; {4438#false} is VALID [2018-11-23 12:01:37,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {4438#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4438#false} is VALID [2018-11-23 12:01:37,050 INFO L256 TraceCheckUtils]: 63: Hoare triple {4438#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {4438#false} is VALID [2018-11-23 12:01:37,050 INFO L273 TraceCheckUtils]: 64: Hoare triple {4438#false} ~cond := #in~cond; {4438#false} is VALID [2018-11-23 12:01:37,050 INFO L273 TraceCheckUtils]: 65: Hoare triple {4438#false} assume 0 == ~cond; {4438#false} is VALID [2018-11-23 12:01:37,050 INFO L273 TraceCheckUtils]: 66: Hoare triple {4438#false} assume !false; {4438#false} is VALID [2018-11-23 12:01:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 12:01:37,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:37,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:37,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:01:37,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:01:37,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:37,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:37,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {4437#true} call ULTIMATE.init(); {4437#true} is VALID [2018-11-23 12:01:37,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {4437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4437#true} is VALID [2018-11-23 12:01:37,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {4437#true} assume true; {4437#true} is VALID [2018-11-23 12:01:37,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4437#true} {4437#true} #76#return; {4437#true} is VALID [2018-11-23 12:01:37,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {4437#true} call #t~ret6 := main(); {4437#true} is VALID [2018-11-23 12:01:37,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {4437#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4437#true} is VALID [2018-11-23 12:01:37,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {4437#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4437#true} is VALID [2018-11-23 12:01:37,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {4437#true} assume !(~i~0 < 100000); {4437#true} is VALID [2018-11-23 12:01:37,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#true} ~i~0 := 0; {4504#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:37,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {4504#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4504#(<= main_~i~0 0)} is VALID [2018-11-23 12:01:37,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {4504#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {4440#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4440#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:37,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {4440#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {4441#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4441#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:37,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {4441#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {4442#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4442#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:37,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {4442#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {4443#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4443#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:37,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {4443#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {4444#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4444#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:37,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {4444#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {4445#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4445#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:37,369 INFO L273 TraceCheckUtils]: 31: Hoare triple {4445#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {4446#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4446#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:37,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {4446#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,371 INFO L273 TraceCheckUtils]: 34: Hoare triple {4447#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4447#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:37,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {4447#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {4448#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {4448#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:37,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {4448#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4449#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:37,374 INFO L273 TraceCheckUtils]: 38: Hoare triple {4449#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:01:37,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {4438#false} ~i~0 := 0; {4438#false} is VALID [2018-11-23 12:01:37,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,375 INFO L273 TraceCheckUtils]: 41: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,376 INFO L273 TraceCheckUtils]: 43: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,376 INFO L273 TraceCheckUtils]: 45: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,377 INFO L273 TraceCheckUtils]: 46: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,377 INFO L273 TraceCheckUtils]: 47: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,377 INFO L273 TraceCheckUtils]: 48: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,377 INFO L273 TraceCheckUtils]: 49: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,378 INFO L273 TraceCheckUtils]: 53: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,379 INFO L273 TraceCheckUtils]: 55: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,379 INFO L273 TraceCheckUtils]: 56: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,379 INFO L273 TraceCheckUtils]: 57: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,379 INFO L273 TraceCheckUtils]: 58: Hoare triple {4438#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {4438#false} is VALID [2018-11-23 12:01:37,380 INFO L273 TraceCheckUtils]: 59: Hoare triple {4438#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4438#false} is VALID [2018-11-23 12:01:37,380 INFO L273 TraceCheckUtils]: 60: Hoare triple {4438#false} assume !(~i~0 < 100000); {4438#false} is VALID [2018-11-23 12:01:37,380 INFO L273 TraceCheckUtils]: 61: Hoare triple {4438#false} havoc ~x~0;~x~0 := 0; {4438#false} is VALID [2018-11-23 12:01:37,380 INFO L273 TraceCheckUtils]: 62: Hoare triple {4438#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {4438#false} is VALID [2018-11-23 12:01:37,380 INFO L256 TraceCheckUtils]: 63: Hoare triple {4438#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {4438#false} is VALID [2018-11-23 12:01:37,380 INFO L273 TraceCheckUtils]: 64: Hoare triple {4438#false} ~cond := #in~cond; {4438#false} is VALID [2018-11-23 12:01:37,381 INFO L273 TraceCheckUtils]: 65: Hoare triple {4438#false} assume 0 == ~cond; {4438#false} is VALID [2018-11-23 12:01:37,381 INFO L273 TraceCheckUtils]: 66: Hoare triple {4438#false} assume !false; {4438#false} is VALID [2018-11-23 12:01:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 12:01:37,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:37,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:01:37,405 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:01:37,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:37,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:01:37,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:37,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:01:37,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:01:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:01:37,470 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 14 states. [2018-11-23 12:01:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:37,807 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-11-23 12:01:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:01:37,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-23 12:01:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 12:01:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:01:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 12:01:37,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 104 transitions. [2018-11-23 12:01:38,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:38,467 INFO L225 Difference]: With dead ends: 134 [2018-11-23 12:01:38,467 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:01:38,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:01:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:01:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-23 12:01:38,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:38,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 77 states. [2018-11-23 12:01:38,545 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 77 states. [2018-11-23 12:01:38,545 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 77 states. [2018-11-23 12:01:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,546 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 12:01:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 12:01:38,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:38,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:38,547 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 79 states. [2018-11-23 12:01:38,547 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 79 states. [2018-11-23 12:01:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:38,548 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-23 12:01:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-23 12:01:38,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:38,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:38,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:38,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:01:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-23 12:01:38,551 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 67 [2018-11-23 12:01:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:38,551 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-23 12:01:38,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:01:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-23 12:01:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:01:38,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:38,552 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:38,552 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:38,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2083114930, now seen corresponding path program 11 times [2018-11-23 12:01:38,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:38,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:38,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:39,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {5131#true} call ULTIMATE.init(); {5131#true} is VALID [2018-11-23 12:01:39,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {5131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5131#true} is VALID [2018-11-23 12:01:39,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {5131#true} assume true; {5131#true} is VALID [2018-11-23 12:01:39,128 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5131#true} {5131#true} #76#return; {5131#true} is VALID [2018-11-23 12:01:39,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {5131#true} call #t~ret6 := main(); {5131#true} is VALID [2018-11-23 12:01:39,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {5131#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5133#(= main_~i~0 0)} is VALID [2018-11-23 12:01:39,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {5133#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 12:01:39,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {5134#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:39,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {5135#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:39,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {5136#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:39,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {5137#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:39,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {5138#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:39,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {5139#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:39,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {5140#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:39,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {5141#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:39,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {5142#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:39,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {5143#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5144#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:39,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {5144#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:01:39,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {5132#false} ~i~0 := 0; {5132#false} is VALID [2018-11-23 12:01:39,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,140 INFO L273 TraceCheckUtils]: 29: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,141 INFO L273 TraceCheckUtils]: 34: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,141 INFO L273 TraceCheckUtils]: 35: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 38: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {5132#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 41: Hoare triple {5132#false} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 42: Hoare triple {5132#false} ~i~0 := 0; {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 43: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 46: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 47: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 48: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 49: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 52: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,143 INFO L273 TraceCheckUtils]: 53: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 54: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 55: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 56: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 57: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 58: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 60: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,144 INFO L273 TraceCheckUtils]: 61: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 62: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 63: Hoare triple {5132#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {5132#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 65: Hoare triple {5132#false} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {5132#false} havoc ~x~0;~x~0 := 0; {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {5132#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L256 TraceCheckUtils]: 68: Hoare triple {5132#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 69: Hoare triple {5132#false} ~cond := #in~cond; {5132#false} is VALID [2018-11-23 12:01:39,145 INFO L273 TraceCheckUtils]: 70: Hoare triple {5132#false} assume 0 == ~cond; {5132#false} is VALID [2018-11-23 12:01:39,146 INFO L273 TraceCheckUtils]: 71: Hoare triple {5132#false} assume !false; {5132#false} is VALID [2018-11-23 12:01:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:01:39,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:39,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:01:39,158 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:01:59,895 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:01:59,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:01:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:59,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:00,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {5131#true} call ULTIMATE.init(); {5131#true} is VALID [2018-11-23 12:02:00,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {5131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5131#true} is VALID [2018-11-23 12:02:00,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {5131#true} assume true; {5131#true} is VALID [2018-11-23 12:02:00,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5131#true} {5131#true} #76#return; {5131#true} is VALID [2018-11-23 12:02:00,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {5131#true} call #t~ret6 := main(); {5131#true} is VALID [2018-11-23 12:02:00,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {5131#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5131#true} is VALID [2018-11-23 12:02:00,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 13: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {5131#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5131#true} is VALID [2018-11-23 12:02:00,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {5131#true} assume !(~i~0 < 100000); {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {5131#true} ~i~0 := 0; {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 23: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 28: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 32: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 34: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 36: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {5131#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {5131#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5131#true} is VALID [2018-11-23 12:02:00,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {5131#true} assume !(~i~0 < 100000); {5131#true} is VALID [2018-11-23 12:02:00,255 INFO L273 TraceCheckUtils]: 42: Hoare triple {5131#true} ~i~0 := 0; {5274#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:00,255 INFO L273 TraceCheckUtils]: 43: Hoare triple {5274#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5274#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:00,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {5274#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:00,256 INFO L273 TraceCheckUtils]: 45: Hoare triple {5134#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5134#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:00,256 INFO L273 TraceCheckUtils]: 46: Hoare triple {5134#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:00,257 INFO L273 TraceCheckUtils]: 47: Hoare triple {5135#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5135#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:00,257 INFO L273 TraceCheckUtils]: 48: Hoare triple {5135#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:00,257 INFO L273 TraceCheckUtils]: 49: Hoare triple {5136#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5136#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:00,258 INFO L273 TraceCheckUtils]: 50: Hoare triple {5136#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:00,258 INFO L273 TraceCheckUtils]: 51: Hoare triple {5137#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5137#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:00,259 INFO L273 TraceCheckUtils]: 52: Hoare triple {5137#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:00,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {5138#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5138#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:00,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {5138#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:00,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {5139#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5139#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:00,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {5139#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:00,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {5140#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5140#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:00,263 INFO L273 TraceCheckUtils]: 58: Hoare triple {5140#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:00,263 INFO L273 TraceCheckUtils]: 59: Hoare triple {5141#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5141#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:00,264 INFO L273 TraceCheckUtils]: 60: Hoare triple {5141#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:00,264 INFO L273 TraceCheckUtils]: 61: Hoare triple {5142#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5142#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:00,265 INFO L273 TraceCheckUtils]: 62: Hoare triple {5142#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:00,266 INFO L273 TraceCheckUtils]: 63: Hoare triple {5143#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5143#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:00,266 INFO L273 TraceCheckUtils]: 64: Hoare triple {5143#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5144#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:00,267 INFO L273 TraceCheckUtils]: 65: Hoare triple {5144#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5132#false} is VALID [2018-11-23 12:02:00,267 INFO L273 TraceCheckUtils]: 66: Hoare triple {5132#false} havoc ~x~0;~x~0 := 0; {5132#false} is VALID [2018-11-23 12:02:00,268 INFO L273 TraceCheckUtils]: 67: Hoare triple {5132#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5132#false} is VALID [2018-11-23 12:02:00,268 INFO L256 TraceCheckUtils]: 68: Hoare triple {5132#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5132#false} is VALID [2018-11-23 12:02:00,268 INFO L273 TraceCheckUtils]: 69: Hoare triple {5132#false} ~cond := #in~cond; {5132#false} is VALID [2018-11-23 12:02:00,268 INFO L273 TraceCheckUtils]: 70: Hoare triple {5132#false} assume 0 == ~cond; {5132#false} is VALID [2018-11-23 12:02:00,268 INFO L273 TraceCheckUtils]: 71: Hoare triple {5132#false} assume !false; {5132#false} is VALID [2018-11-23 12:02:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:02:00,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:02:00,297 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:02:00,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:00,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:02:00,357 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 12:02:00,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:02:00,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:02:00,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:00,359 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 15 states. [2018-11-23 12:02:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,077 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-11-23 12:02:01,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:02:01,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:02:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2018-11-23 12:02:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2018-11-23 12:02:01,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 109 transitions. [2018-11-23 12:02:01,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:01,585 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:02:01,585 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:02:01,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:02:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 12:02:01,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:01,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-23 12:02:01,626 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-23 12:02:01,626 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-23 12:02:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,629 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-23 12:02:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 12:02:01,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:01,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:01,629 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-23 12:02:01,630 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-23 12:02:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:01,631 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-23 12:02:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-23 12:02:01,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:01,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:01,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:01,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:02:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 12:02:01,634 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 72 [2018-11-23 12:02:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:01,634 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 12:02:01,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:02:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 12:02:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:02:01,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:01,636 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:01,636 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:01,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash 385857002, now seen corresponding path program 12 times [2018-11-23 12:02:01,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:01,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:01,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:01,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:02,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {5873#true} call ULTIMATE.init(); {5873#true} is VALID [2018-11-23 12:02:02,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {5873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5873#true} is VALID [2018-11-23 12:02:02,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {5873#true} assume true; {5873#true} is VALID [2018-11-23 12:02:02,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5873#true} {5873#true} #76#return; {5873#true} is VALID [2018-11-23 12:02:02,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {5873#true} call #t~ret6 := main(); {5873#true} is VALID [2018-11-23 12:02:02,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {5873#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5875#(= main_~i~0 0)} is VALID [2018-11-23 12:02:02,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {5875#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:02,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {5876#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:02,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {5877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:02,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {5878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:02,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {5879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:02,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {5880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:02,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {5881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:02,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {5882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:02,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {5883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:02,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {5884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:02,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {5885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:02,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {5886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5887#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:02,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {5887#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:02,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {5874#false} ~i~0 := 0; {5874#false} is VALID [2018-11-23 12:02:02,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,699 INFO L273 TraceCheckUtils]: 28: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,699 INFO L273 TraceCheckUtils]: 29: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,700 INFO L273 TraceCheckUtils]: 31: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,702 INFO L273 TraceCheckUtils]: 39: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5874#false} is VALID [2018-11-23 12:02:02,702 INFO L273 TraceCheckUtils]: 43: Hoare triple {5874#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#false} is VALID [2018-11-23 12:02:02,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {5874#false} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:02,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {5874#false} ~i~0 := 0; {5874#false} is VALID [2018-11-23 12:02:02,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,704 INFO L273 TraceCheckUtils]: 55: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,704 INFO L273 TraceCheckUtils]: 56: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,705 INFO L273 TraceCheckUtils]: 58: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,705 INFO L273 TraceCheckUtils]: 59: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,705 INFO L273 TraceCheckUtils]: 60: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,705 INFO L273 TraceCheckUtils]: 61: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,705 INFO L273 TraceCheckUtils]: 62: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,705 INFO L273 TraceCheckUtils]: 63: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,706 INFO L273 TraceCheckUtils]: 64: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,706 INFO L273 TraceCheckUtils]: 65: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,706 INFO L273 TraceCheckUtils]: 66: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,706 INFO L273 TraceCheckUtils]: 67: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,706 INFO L273 TraceCheckUtils]: 68: Hoare triple {5874#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5874#false} is VALID [2018-11-23 12:02:02,706 INFO L273 TraceCheckUtils]: 69: Hoare triple {5874#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5874#false} is VALID [2018-11-23 12:02:02,707 INFO L273 TraceCheckUtils]: 70: Hoare triple {5874#false} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:02,707 INFO L273 TraceCheckUtils]: 71: Hoare triple {5874#false} havoc ~x~0;~x~0 := 0; {5874#false} is VALID [2018-11-23 12:02:02,707 INFO L273 TraceCheckUtils]: 72: Hoare triple {5874#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5874#false} is VALID [2018-11-23 12:02:02,707 INFO L256 TraceCheckUtils]: 73: Hoare triple {5874#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5874#false} is VALID [2018-11-23 12:02:02,707 INFO L273 TraceCheckUtils]: 74: Hoare triple {5874#false} ~cond := #in~cond; {5874#false} is VALID [2018-11-23 12:02:02,707 INFO L273 TraceCheckUtils]: 75: Hoare triple {5874#false} assume 0 == ~cond; {5874#false} is VALID [2018-11-23 12:02:02,708 INFO L273 TraceCheckUtils]: 76: Hoare triple {5874#false} assume !false; {5874#false} is VALID [2018-11-23 12:02:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-23 12:02:02,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:02,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:02,721 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:19,008 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:02:19,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:19,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:19,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {5873#true} call ULTIMATE.init(); {5873#true} is VALID [2018-11-23 12:02:19,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {5873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5873#true} is VALID [2018-11-23 12:02:19,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {5873#true} assume true; {5873#true} is VALID [2018-11-23 12:02:19,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5873#true} {5873#true} #76#return; {5873#true} is VALID [2018-11-23 12:02:19,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {5873#true} call #t~ret6 := main(); {5873#true} is VALID [2018-11-23 12:02:19,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {5873#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5873#true} is VALID [2018-11-23 12:02:19,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {5873#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {5873#true} assume !(~i~0 < 100000); {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {5873#true} ~i~0 := 0; {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 28: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 33: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 36: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 37: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,223 INFO L273 TraceCheckUtils]: 38: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,224 INFO L273 TraceCheckUtils]: 39: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,224 INFO L273 TraceCheckUtils]: 40: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,224 INFO L273 TraceCheckUtils]: 41: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,224 INFO L273 TraceCheckUtils]: 42: Hoare triple {5873#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {5873#true} is VALID [2018-11-23 12:02:19,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {5873#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5873#true} is VALID [2018-11-23 12:02:19,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {5873#true} assume !(~i~0 < 100000); {5873#true} is VALID [2018-11-23 12:02:19,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {5873#true} ~i~0 := 0; {6026#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:19,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {6026#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6026#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:19,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {6026#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:19,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {5876#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5876#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:19,226 INFO L273 TraceCheckUtils]: 49: Hoare triple {5876#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:19,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {5877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5877#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:19,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {5877#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:19,227 INFO L273 TraceCheckUtils]: 52: Hoare triple {5878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5878#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:19,228 INFO L273 TraceCheckUtils]: 53: Hoare triple {5878#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:19,228 INFO L273 TraceCheckUtils]: 54: Hoare triple {5879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5879#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:19,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {5879#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:19,229 INFO L273 TraceCheckUtils]: 56: Hoare triple {5880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5880#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:19,229 INFO L273 TraceCheckUtils]: 57: Hoare triple {5880#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:19,230 INFO L273 TraceCheckUtils]: 58: Hoare triple {5881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5881#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:19,231 INFO L273 TraceCheckUtils]: 59: Hoare triple {5881#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:19,231 INFO L273 TraceCheckUtils]: 60: Hoare triple {5882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5882#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:19,232 INFO L273 TraceCheckUtils]: 61: Hoare triple {5882#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:19,233 INFO L273 TraceCheckUtils]: 62: Hoare triple {5883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5883#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:19,233 INFO L273 TraceCheckUtils]: 63: Hoare triple {5883#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:19,234 INFO L273 TraceCheckUtils]: 64: Hoare triple {5884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5884#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:19,235 INFO L273 TraceCheckUtils]: 65: Hoare triple {5884#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:19,235 INFO L273 TraceCheckUtils]: 66: Hoare triple {5885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5885#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:19,236 INFO L273 TraceCheckUtils]: 67: Hoare triple {5885#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:19,236 INFO L273 TraceCheckUtils]: 68: Hoare triple {5886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {5886#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:19,237 INFO L273 TraceCheckUtils]: 69: Hoare triple {5886#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5887#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:19,238 INFO L273 TraceCheckUtils]: 70: Hoare triple {5887#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5874#false} is VALID [2018-11-23 12:02:19,238 INFO L273 TraceCheckUtils]: 71: Hoare triple {5874#false} havoc ~x~0;~x~0 := 0; {5874#false} is VALID [2018-11-23 12:02:19,238 INFO L273 TraceCheckUtils]: 72: Hoare triple {5874#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {5874#false} is VALID [2018-11-23 12:02:19,239 INFO L256 TraceCheckUtils]: 73: Hoare triple {5874#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5874#false} is VALID [2018-11-23 12:02:19,239 INFO L273 TraceCheckUtils]: 74: Hoare triple {5874#false} ~cond := #in~cond; {5874#false} is VALID [2018-11-23 12:02:19,239 INFO L273 TraceCheckUtils]: 75: Hoare triple {5874#false} assume 0 == ~cond; {5874#false} is VALID [2018-11-23 12:02:19,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {5874#false} assume !false; {5874#false} is VALID [2018-11-23 12:02:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 12:02:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:19,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:02:19,268 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-11-23 12:02:19,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:19,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:02:19,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:19,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:02:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:02:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:19,334 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 16 states. [2018-11-23 12:02:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:19,792 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:02:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:02:19,793 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-11-23 12:02:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-23 12:02:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-23 12:02:19,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 114 transitions. [2018-11-23 12:02:19,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:19,922 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:02:19,923 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:02:19,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:02:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-23 12:02:19,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:19,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 87 states. [2018-11-23 12:02:19,985 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 87 states. [2018-11-23 12:02:19,985 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 87 states. [2018-11-23 12:02:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:19,987 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-23 12:02:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-23 12:02:19,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:19,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:19,987 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 89 states. [2018-11-23 12:02:19,987 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 89 states. [2018-11-23 12:02:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:19,989 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-23 12:02:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-11-23 12:02:19,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:19,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:19,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:19,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:02:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-11-23 12:02:19,991 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 77 [2018-11-23 12:02:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:19,991 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-11-23 12:02:19,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:02:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-11-23 12:02:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:02:19,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:19,993 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:19,993 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:19,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1239413930, now seen corresponding path program 13 times [2018-11-23 12:02:19,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:19,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:19,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:20,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {6663#true} call ULTIMATE.init(); {6663#true} is VALID [2018-11-23 12:02:20,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {6663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6663#true} is VALID [2018-11-23 12:02:20,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {6663#true} assume true; {6663#true} is VALID [2018-11-23 12:02:20,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6663#true} {6663#true} #76#return; {6663#true} is VALID [2018-11-23 12:02:20,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {6663#true} call #t~ret6 := main(); {6663#true} is VALID [2018-11-23 12:02:20,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {6663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6665#(= main_~i~0 0)} is VALID [2018-11-23 12:02:20,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {6665#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6666#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:20,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {6666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6667#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:20,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {6667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6668#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:20,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {6668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6669#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:20,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {6669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6670#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:20,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {6670#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6671#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:20,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {6671#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6672#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:20,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {6672#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6673#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:20,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {6673#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6674#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:20,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {6674#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6675#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:20,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {6675#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6676#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:20,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {6676#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6677#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:20,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {6677#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6678#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:20,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {6678#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6664#false} is VALID [2018-11-23 12:02:20,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {6664#false} ~i~0 := 0; {6664#false} is VALID [2018-11-23 12:02:20,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,802 INFO L273 TraceCheckUtils]: 24: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 39: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {6664#false} assume !(~i~0 < 100000); {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {6664#false} ~i~0 := 0; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 53: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,806 INFO L273 TraceCheckUtils]: 54: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 63: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 64: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 66: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 67: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 69: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,808 INFO L273 TraceCheckUtils]: 70: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L273 TraceCheckUtils]: 71: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {6664#false} assume !(~i~0 < 100000); {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {6664#false} havoc ~x~0;~x~0 := 0; {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {6664#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6664#false} is VALID [2018-11-23 12:02:20,809 INFO L256 TraceCheckUtils]: 78: Hoare triple {6664#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {6664#false} is VALID [2018-11-23 12:02:20,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {6664#false} ~cond := #in~cond; {6664#false} is VALID [2018-11-23 12:02:20,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {6664#false} assume 0 == ~cond; {6664#false} is VALID [2018-11-23 12:02:20,810 INFO L273 TraceCheckUtils]: 81: Hoare triple {6664#false} assume !false; {6664#false} is VALID [2018-11-23 12:02:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-23 12:02:20,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:20,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:20,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:21,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {6663#true} call ULTIMATE.init(); {6663#true} is VALID [2018-11-23 12:02:21,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {6663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6663#true} is VALID [2018-11-23 12:02:21,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {6663#true} assume true; {6663#true} is VALID [2018-11-23 12:02:21,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6663#true} {6663#true} #76#return; {6663#true} is VALID [2018-11-23 12:02:21,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {6663#true} call #t~ret6 := main(); {6663#true} is VALID [2018-11-23 12:02:21,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {6663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6697#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:21,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {6697#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6666#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:21,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {6666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6667#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:21,026 INFO L273 TraceCheckUtils]: 8: Hoare triple {6667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6668#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:21,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {6668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6669#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:21,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {6669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6670#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:21,027 INFO L273 TraceCheckUtils]: 11: Hoare triple {6670#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6671#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:21,028 INFO L273 TraceCheckUtils]: 12: Hoare triple {6671#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6672#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:21,029 INFO L273 TraceCheckUtils]: 13: Hoare triple {6672#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6673#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:21,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {6673#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6674#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:21,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {6674#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6675#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:21,032 INFO L273 TraceCheckUtils]: 16: Hoare triple {6675#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6676#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:21,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {6676#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6677#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:21,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {6677#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6678#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:21,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {6678#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6664#false} is VALID [2018-11-23 12:02:21,034 INFO L273 TraceCheckUtils]: 20: Hoare triple {6664#false} ~i~0 := 0; {6664#false} is VALID [2018-11-23 12:02:21,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,036 INFO L273 TraceCheckUtils]: 29: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,037 INFO L273 TraceCheckUtils]: 31: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,037 INFO L273 TraceCheckUtils]: 32: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,038 INFO L273 TraceCheckUtils]: 37: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,039 INFO L273 TraceCheckUtils]: 39: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,039 INFO L273 TraceCheckUtils]: 40: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,039 INFO L273 TraceCheckUtils]: 41: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,039 INFO L273 TraceCheckUtils]: 42: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,039 INFO L273 TraceCheckUtils]: 43: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,040 INFO L273 TraceCheckUtils]: 44: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,040 INFO L273 TraceCheckUtils]: 45: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {6664#false} is VALID [2018-11-23 12:02:21,040 INFO L273 TraceCheckUtils]: 46: Hoare triple {6664#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6664#false} is VALID [2018-11-23 12:02:21,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {6664#false} assume !(~i~0 < 100000); {6664#false} is VALID [2018-11-23 12:02:21,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {6664#false} ~i~0 := 0; {6664#false} is VALID [2018-11-23 12:02:21,040 INFO L273 TraceCheckUtils]: 49: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,041 INFO L273 TraceCheckUtils]: 50: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,041 INFO L273 TraceCheckUtils]: 51: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,041 INFO L273 TraceCheckUtils]: 52: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,041 INFO L273 TraceCheckUtils]: 53: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,041 INFO L273 TraceCheckUtils]: 54: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,042 INFO L273 TraceCheckUtils]: 56: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,042 INFO L273 TraceCheckUtils]: 57: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,042 INFO L273 TraceCheckUtils]: 58: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,042 INFO L273 TraceCheckUtils]: 59: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,042 INFO L273 TraceCheckUtils]: 60: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,042 INFO L273 TraceCheckUtils]: 61: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,043 INFO L273 TraceCheckUtils]: 62: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,043 INFO L273 TraceCheckUtils]: 63: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,043 INFO L273 TraceCheckUtils]: 64: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,043 INFO L273 TraceCheckUtils]: 65: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,043 INFO L273 TraceCheckUtils]: 66: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,043 INFO L273 TraceCheckUtils]: 67: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,044 INFO L273 TraceCheckUtils]: 68: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,044 INFO L273 TraceCheckUtils]: 69: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,044 INFO L273 TraceCheckUtils]: 70: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,044 INFO L273 TraceCheckUtils]: 71: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,044 INFO L273 TraceCheckUtils]: 72: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,044 INFO L273 TraceCheckUtils]: 73: Hoare triple {6664#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {6664#false} is VALID [2018-11-23 12:02:21,045 INFO L273 TraceCheckUtils]: 74: Hoare triple {6664#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6664#false} is VALID [2018-11-23 12:02:21,045 INFO L273 TraceCheckUtils]: 75: Hoare triple {6664#false} assume !(~i~0 < 100000); {6664#false} is VALID [2018-11-23 12:02:21,045 INFO L273 TraceCheckUtils]: 76: Hoare triple {6664#false} havoc ~x~0;~x~0 := 0; {6664#false} is VALID [2018-11-23 12:02:21,045 INFO L273 TraceCheckUtils]: 77: Hoare triple {6664#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {6664#false} is VALID [2018-11-23 12:02:21,045 INFO L256 TraceCheckUtils]: 78: Hoare triple {6664#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {6664#false} is VALID [2018-11-23 12:02:21,045 INFO L273 TraceCheckUtils]: 79: Hoare triple {6664#false} ~cond := #in~cond; {6664#false} is VALID [2018-11-23 12:02:21,046 INFO L273 TraceCheckUtils]: 80: Hoare triple {6664#false} assume 0 == ~cond; {6664#false} is VALID [2018-11-23 12:02:21,046 INFO L273 TraceCheckUtils]: 81: Hoare triple {6664#false} assume !false; {6664#false} is VALID [2018-11-23 12:02:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-23 12:02:21,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:21,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:02:21,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-11-23 12:02:21,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:21,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:02:21,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:21,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:02:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:02:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:21,107 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 17 states. [2018-11-23 12:02:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:21,638 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-11-23 12:02:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:02:21,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-11-23 12:02:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 119 transitions. [2018-11-23 12:02:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 119 transitions. [2018-11-23 12:02:21,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 119 transitions. [2018-11-23 12:02:22,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:22,287 INFO L225 Difference]: With dead ends: 161 [2018-11-23 12:02:22,287 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 12:02:22,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 12:02:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-23 12:02:22,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:22,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-23 12:02:22,457 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-23 12:02:22,457 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-23 12:02:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:22,459 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-11-23 12:02:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-11-23 12:02:22,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:22,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:22,459 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-23 12:02:22,460 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-23 12:02:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:22,461 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-11-23 12:02:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-11-23 12:02:22,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:22,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:22,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:22,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:02:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-23 12:02:22,465 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 82 [2018-11-23 12:02:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:22,465 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-23 12:02:22,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:02:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-23 12:02:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:02:22,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:22,466 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:22,466 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:22,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -535424030, now seen corresponding path program 14 times [2018-11-23 12:02:22,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:22,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:22,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {7501#true} call ULTIMATE.init(); {7501#true} is VALID [2018-11-23 12:02:22,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {7501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7501#true} is VALID [2018-11-23 12:02:22,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {7501#true} assume true; {7501#true} is VALID [2018-11-23 12:02:22,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7501#true} {7501#true} #76#return; {7501#true} is VALID [2018-11-23 12:02:22,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {7501#true} call #t~ret6 := main(); {7501#true} is VALID [2018-11-23 12:02:22,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {7501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7503#(= main_~i~0 0)} is VALID [2018-11-23 12:02:22,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {7503#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7504#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:22,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {7504#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7505#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:22,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {7505#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7506#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:22,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {7506#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7507#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:22,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {7507#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7508#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:22,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {7508#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7509#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:22,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {7509#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7510#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:22,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {7510#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7511#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:22,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {7511#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7512#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:22,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {7512#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7513#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:22,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {7513#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7514#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:22,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {7514#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7515#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:22,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {7515#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7516#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:22,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {7516#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7517#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:22,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {7517#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7502#false} is VALID [2018-11-23 12:02:22,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {7502#false} ~i~0 := 0; {7502#false} is VALID [2018-11-23 12:02:22,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,920 INFO L273 TraceCheckUtils]: 23: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,920 INFO L273 TraceCheckUtils]: 25: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,921 INFO L273 TraceCheckUtils]: 28: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 41: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 45: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 47: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:22,925 INFO L273 TraceCheckUtils]: 49: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:22,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {7502#false} assume !(~i~0 < 100000); {7502#false} is VALID [2018-11-23 12:02:22,925 INFO L273 TraceCheckUtils]: 51: Hoare triple {7502#false} ~i~0 := 0; {7502#false} is VALID [2018-11-23 12:02:22,925 INFO L273 TraceCheckUtils]: 52: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,926 INFO L273 TraceCheckUtils]: 56: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,926 INFO L273 TraceCheckUtils]: 57: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,926 INFO L273 TraceCheckUtils]: 58: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,926 INFO L273 TraceCheckUtils]: 59: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,926 INFO L273 TraceCheckUtils]: 60: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,926 INFO L273 TraceCheckUtils]: 61: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,927 INFO L273 TraceCheckUtils]: 62: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,927 INFO L273 TraceCheckUtils]: 63: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,927 INFO L273 TraceCheckUtils]: 64: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,927 INFO L273 TraceCheckUtils]: 65: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,927 INFO L273 TraceCheckUtils]: 66: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,927 INFO L273 TraceCheckUtils]: 67: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,927 INFO L273 TraceCheckUtils]: 68: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 69: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 70: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 71: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 72: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 73: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 74: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 75: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,928 INFO L273 TraceCheckUtils]: 76: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L273 TraceCheckUtils]: 77: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L273 TraceCheckUtils]: 78: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L273 TraceCheckUtils]: 79: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L273 TraceCheckUtils]: 80: Hoare triple {7502#false} assume !(~i~0 < 100000); {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L273 TraceCheckUtils]: 81: Hoare triple {7502#false} havoc ~x~0;~x~0 := 0; {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L273 TraceCheckUtils]: 82: Hoare triple {7502#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L256 TraceCheckUtils]: 83: Hoare triple {7502#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {7502#false} is VALID [2018-11-23 12:02:22,929 INFO L273 TraceCheckUtils]: 84: Hoare triple {7502#false} ~cond := #in~cond; {7502#false} is VALID [2018-11-23 12:02:22,930 INFO L273 TraceCheckUtils]: 85: Hoare triple {7502#false} assume 0 == ~cond; {7502#false} is VALID [2018-11-23 12:02:22,930 INFO L273 TraceCheckUtils]: 86: Hoare triple {7502#false} assume !false; {7502#false} is VALID [2018-11-23 12:02:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 12:02:22,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:22,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:22,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:22,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:22,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:23,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:23,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {7501#true} call ULTIMATE.init(); {7501#true} is VALID [2018-11-23 12:02:23,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {7501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7501#true} is VALID [2018-11-23 12:02:23,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {7501#true} assume true; {7501#true} is VALID [2018-11-23 12:02:23,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7501#true} {7501#true} #76#return; {7501#true} is VALID [2018-11-23 12:02:23,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {7501#true} call #t~ret6 := main(); {7501#true} is VALID [2018-11-23 12:02:23,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {7501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7536#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:23,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {7536#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7504#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:23,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {7504#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7505#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:23,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {7505#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7506#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:23,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {7506#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7507#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:23,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {7507#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7508#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:23,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {7508#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7509#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:23,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {7509#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7510#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:23,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {7510#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7511#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:23,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {7511#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7512#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:23,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {7512#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7513#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:23,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {7513#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7514#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:23,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {7514#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7515#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:23,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {7515#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7516#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:23,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {7516#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7517#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:23,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {7517#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7502#false} is VALID [2018-11-23 12:02:23,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {7502#false} ~i~0 := 0; {7502#false} is VALID [2018-11-23 12:02:23,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,294 INFO L273 TraceCheckUtils]: 31: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,296 INFO L273 TraceCheckUtils]: 35: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,296 INFO L273 TraceCheckUtils]: 36: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,297 INFO L273 TraceCheckUtils]: 37: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,297 INFO L273 TraceCheckUtils]: 38: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,297 INFO L273 TraceCheckUtils]: 40: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,298 INFO L273 TraceCheckUtils]: 42: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,298 INFO L273 TraceCheckUtils]: 43: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,298 INFO L273 TraceCheckUtils]: 44: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,299 INFO L273 TraceCheckUtils]: 48: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {7502#false} is VALID [2018-11-23 12:02:23,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {7502#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7502#false} is VALID [2018-11-23 12:02:23,300 INFO L273 TraceCheckUtils]: 50: Hoare triple {7502#false} assume !(~i~0 < 100000); {7502#false} is VALID [2018-11-23 12:02:23,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {7502#false} ~i~0 := 0; {7502#false} is VALID [2018-11-23 12:02:23,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,301 INFO L273 TraceCheckUtils]: 57: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,301 INFO L273 TraceCheckUtils]: 58: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,302 INFO L273 TraceCheckUtils]: 60: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,302 INFO L273 TraceCheckUtils]: 61: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,302 INFO L273 TraceCheckUtils]: 62: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,303 INFO L273 TraceCheckUtils]: 64: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,303 INFO L273 TraceCheckUtils]: 65: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,303 INFO L273 TraceCheckUtils]: 66: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,303 INFO L273 TraceCheckUtils]: 67: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,304 INFO L273 TraceCheckUtils]: 68: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,304 INFO L273 TraceCheckUtils]: 69: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,304 INFO L273 TraceCheckUtils]: 70: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,304 INFO L273 TraceCheckUtils]: 71: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,304 INFO L273 TraceCheckUtils]: 72: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,305 INFO L273 TraceCheckUtils]: 73: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,305 INFO L273 TraceCheckUtils]: 74: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,305 INFO L273 TraceCheckUtils]: 75: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,305 INFO L273 TraceCheckUtils]: 76: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,305 INFO L273 TraceCheckUtils]: 77: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,306 INFO L273 TraceCheckUtils]: 78: Hoare triple {7502#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {7502#false} is VALID [2018-11-23 12:02:23,306 INFO L273 TraceCheckUtils]: 79: Hoare triple {7502#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7502#false} is VALID [2018-11-23 12:02:23,306 INFO L273 TraceCheckUtils]: 80: Hoare triple {7502#false} assume !(~i~0 < 100000); {7502#false} is VALID [2018-11-23 12:02:23,306 INFO L273 TraceCheckUtils]: 81: Hoare triple {7502#false} havoc ~x~0;~x~0 := 0; {7502#false} is VALID [2018-11-23 12:02:23,306 INFO L273 TraceCheckUtils]: 82: Hoare triple {7502#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {7502#false} is VALID [2018-11-23 12:02:23,307 INFO L256 TraceCheckUtils]: 83: Hoare triple {7502#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {7502#false} is VALID [2018-11-23 12:02:23,307 INFO L273 TraceCheckUtils]: 84: Hoare triple {7502#false} ~cond := #in~cond; {7502#false} is VALID [2018-11-23 12:02:23,307 INFO L273 TraceCheckUtils]: 85: Hoare triple {7502#false} assume 0 == ~cond; {7502#false} is VALID [2018-11-23 12:02:23,307 INFO L273 TraceCheckUtils]: 86: Hoare triple {7502#false} assume !false; {7502#false} is VALID [2018-11-23 12:02:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 12:02:23,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:23,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:02:23,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-23 12:02:23,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:23,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:02:23,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:23,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:02:23,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:02:23,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:23,397 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 18 states. [2018-11-23 12:02:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,114 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-11-23 12:02:24,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:02:24,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-23 12:02:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 124 transitions. [2018-11-23 12:02:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 124 transitions. [2018-11-23 12:02:24,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 124 transitions. [2018-11-23 12:02:24,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:24,758 INFO L225 Difference]: With dead ends: 170 [2018-11-23 12:02:24,758 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 12:02:24,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 12:02:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-23 12:02:24,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:24,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2018-11-23 12:02:24,799 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2018-11-23 12:02:24,799 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2018-11-23 12:02:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,802 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 12:02:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 12:02:24,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,803 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2018-11-23 12:02:24,803 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2018-11-23 12:02:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,805 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-23 12:02:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-23 12:02:24,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:24,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:02:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-11-23 12:02:24,808 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 87 [2018-11-23 12:02:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:24,808 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-11-23 12:02:24,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:02:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-11-23 12:02:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:02:24,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:24,810 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:24,810 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:24,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash -422313566, now seen corresponding path program 15 times [2018-11-23 12:02:24,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:24,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:25,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {8387#true} call ULTIMATE.init(); {8387#true} is VALID [2018-11-23 12:02:25,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {8387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8387#true} is VALID [2018-11-23 12:02:25,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {8387#true} assume true; {8387#true} is VALID [2018-11-23 12:02:25,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8387#true} {8387#true} #76#return; {8387#true} is VALID [2018-11-23 12:02:25,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {8387#true} call #t~ret6 := main(); {8387#true} is VALID [2018-11-23 12:02:25,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {8387#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8389#(= main_~i~0 0)} is VALID [2018-11-23 12:02:25,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {8389#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:25,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {8390#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:25,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {8391#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8392#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:25,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {8392#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8393#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:25,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {8393#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8394#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:25,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {8394#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8395#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:25,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {8395#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8396#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:25,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {8396#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8397#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:25,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {8397#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8398#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:25,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {8398#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8399#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:25,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {8399#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8400#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:25,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {8400#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8401#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:25,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {8401#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8402#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:25,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {8402#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8403#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:25,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {8403#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8404#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:25,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {8404#(<= main_~i~0 15)} assume !(~i~0 < 100000); {8388#false} is VALID [2018-11-23 12:02:25,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {8388#false} ~i~0 := 0; {8388#false} is VALID [2018-11-23 12:02:25,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,741 INFO L273 TraceCheckUtils]: 27: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,742 INFO L273 TraceCheckUtils]: 34: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,743 INFO L273 TraceCheckUtils]: 36: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,745 INFO L273 TraceCheckUtils]: 47: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,745 INFO L273 TraceCheckUtils]: 50: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,746 INFO L273 TraceCheckUtils]: 51: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:25,746 INFO L273 TraceCheckUtils]: 52: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:25,746 INFO L273 TraceCheckUtils]: 53: Hoare triple {8388#false} assume !(~i~0 < 100000); {8388#false} is VALID [2018-11-23 12:02:25,746 INFO L273 TraceCheckUtils]: 54: Hoare triple {8388#false} ~i~0 := 0; {8388#false} is VALID [2018-11-23 12:02:25,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,747 INFO L273 TraceCheckUtils]: 56: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,748 INFO L273 TraceCheckUtils]: 63: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,748 INFO L273 TraceCheckUtils]: 64: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,748 INFO L273 TraceCheckUtils]: 65: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,748 INFO L273 TraceCheckUtils]: 66: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,749 INFO L273 TraceCheckUtils]: 67: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,749 INFO L273 TraceCheckUtils]: 68: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,749 INFO L273 TraceCheckUtils]: 69: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,749 INFO L273 TraceCheckUtils]: 70: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,749 INFO L273 TraceCheckUtils]: 71: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,749 INFO L273 TraceCheckUtils]: 72: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,750 INFO L273 TraceCheckUtils]: 73: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,750 INFO L273 TraceCheckUtils]: 74: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,750 INFO L273 TraceCheckUtils]: 75: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,750 INFO L273 TraceCheckUtils]: 76: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,750 INFO L273 TraceCheckUtils]: 78: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,751 INFO L273 TraceCheckUtils]: 80: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,751 INFO L273 TraceCheckUtils]: 81: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,751 INFO L273 TraceCheckUtils]: 82: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,751 INFO L273 TraceCheckUtils]: 83: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:25,751 INFO L273 TraceCheckUtils]: 84: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:25,752 INFO L273 TraceCheckUtils]: 85: Hoare triple {8388#false} assume !(~i~0 < 100000); {8388#false} is VALID [2018-11-23 12:02:25,752 INFO L273 TraceCheckUtils]: 86: Hoare triple {8388#false} havoc ~x~0;~x~0 := 0; {8388#false} is VALID [2018-11-23 12:02:25,752 INFO L273 TraceCheckUtils]: 87: Hoare triple {8388#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8388#false} is VALID [2018-11-23 12:02:25,752 INFO L256 TraceCheckUtils]: 88: Hoare triple {8388#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {8388#false} is VALID [2018-11-23 12:02:25,752 INFO L273 TraceCheckUtils]: 89: Hoare triple {8388#false} ~cond := #in~cond; {8388#false} is VALID [2018-11-23 12:02:25,752 INFO L273 TraceCheckUtils]: 90: Hoare triple {8388#false} assume 0 == ~cond; {8388#false} is VALID [2018-11-23 12:02:25,753 INFO L273 TraceCheckUtils]: 91: Hoare triple {8388#false} assume !false; {8388#false} is VALID [2018-11-23 12:02:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-23 12:02:25,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:25,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:25,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:30,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:02:30,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:30,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:30,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {8387#true} call ULTIMATE.init(); {8387#true} is VALID [2018-11-23 12:02:30,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {8387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8387#true} is VALID [2018-11-23 12:02:30,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {8387#true} assume true; {8387#true} is VALID [2018-11-23 12:02:30,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8387#true} {8387#true} #76#return; {8387#true} is VALID [2018-11-23 12:02:30,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {8387#true} call #t~ret6 := main(); {8387#true} is VALID [2018-11-23 12:02:30,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {8387#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8423#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:30,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {8423#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8390#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:30,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {8390#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8391#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:30,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {8391#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8392#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:30,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {8392#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8393#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:30,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {8393#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8394#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:30,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {8394#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8395#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:30,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {8395#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8396#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:30,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {8396#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8397#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:30,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {8397#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8398#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:30,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {8398#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8399#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:30,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {8399#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8400#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:30,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {8400#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8401#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:30,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {8401#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8402#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:30,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {8402#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8403#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:30,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {8403#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8404#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:30,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {8404#(<= main_~i~0 15)} assume !(~i~0 < 100000); {8388#false} is VALID [2018-11-23 12:02:30,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {8388#false} ~i~0 := 0; {8388#false} is VALID [2018-11-23 12:02:30,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,737 INFO L273 TraceCheckUtils]: 26: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,738 INFO L273 TraceCheckUtils]: 27: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,738 INFO L273 TraceCheckUtils]: 30: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,739 INFO L273 TraceCheckUtils]: 32: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,739 INFO L273 TraceCheckUtils]: 33: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,739 INFO L273 TraceCheckUtils]: 34: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,739 INFO L273 TraceCheckUtils]: 35: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,740 INFO L273 TraceCheckUtils]: 36: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,740 INFO L273 TraceCheckUtils]: 37: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,740 INFO L273 TraceCheckUtils]: 39: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,741 INFO L273 TraceCheckUtils]: 41: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,742 INFO L273 TraceCheckUtils]: 43: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,742 INFO L273 TraceCheckUtils]: 44: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,742 INFO L273 TraceCheckUtils]: 45: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,742 INFO L273 TraceCheckUtils]: 46: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,743 INFO L273 TraceCheckUtils]: 47: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,743 INFO L273 TraceCheckUtils]: 48: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,743 INFO L273 TraceCheckUtils]: 49: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,743 INFO L273 TraceCheckUtils]: 51: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {8388#false} is VALID [2018-11-23 12:02:30,743 INFO L273 TraceCheckUtils]: 52: Hoare triple {8388#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8388#false} is VALID [2018-11-23 12:02:30,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {8388#false} assume !(~i~0 < 100000); {8388#false} is VALID [2018-11-23 12:02:30,744 INFO L273 TraceCheckUtils]: 54: Hoare triple {8388#false} ~i~0 := 0; {8388#false} is VALID [2018-11-23 12:02:30,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,744 INFO L273 TraceCheckUtils]: 56: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,744 INFO L273 TraceCheckUtils]: 57: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,744 INFO L273 TraceCheckUtils]: 58: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,744 INFO L273 TraceCheckUtils]: 59: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,745 INFO L273 TraceCheckUtils]: 60: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,745 INFO L273 TraceCheckUtils]: 61: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,745 INFO L273 TraceCheckUtils]: 62: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,745 INFO L273 TraceCheckUtils]: 63: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,745 INFO L273 TraceCheckUtils]: 64: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,745 INFO L273 TraceCheckUtils]: 65: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,746 INFO L273 TraceCheckUtils]: 66: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,746 INFO L273 TraceCheckUtils]: 67: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,746 INFO L273 TraceCheckUtils]: 68: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,746 INFO L273 TraceCheckUtils]: 70: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,746 INFO L273 TraceCheckUtils]: 71: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,747 INFO L273 TraceCheckUtils]: 72: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,747 INFO L273 TraceCheckUtils]: 73: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,747 INFO L273 TraceCheckUtils]: 74: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,747 INFO L273 TraceCheckUtils]: 75: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,747 INFO L273 TraceCheckUtils]: 76: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,747 INFO L273 TraceCheckUtils]: 77: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,748 INFO L273 TraceCheckUtils]: 78: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,748 INFO L273 TraceCheckUtils]: 79: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,748 INFO L273 TraceCheckUtils]: 80: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,748 INFO L273 TraceCheckUtils]: 81: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,748 INFO L273 TraceCheckUtils]: 82: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,748 INFO L273 TraceCheckUtils]: 83: Hoare triple {8388#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {8388#false} is VALID [2018-11-23 12:02:30,749 INFO L273 TraceCheckUtils]: 84: Hoare triple {8388#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8388#false} is VALID [2018-11-23 12:02:30,749 INFO L273 TraceCheckUtils]: 85: Hoare triple {8388#false} assume !(~i~0 < 100000); {8388#false} is VALID [2018-11-23 12:02:30,749 INFO L273 TraceCheckUtils]: 86: Hoare triple {8388#false} havoc ~x~0;~x~0 := 0; {8388#false} is VALID [2018-11-23 12:02:30,749 INFO L273 TraceCheckUtils]: 87: Hoare triple {8388#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {8388#false} is VALID [2018-11-23 12:02:30,749 INFO L256 TraceCheckUtils]: 88: Hoare triple {8388#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {8388#false} is VALID [2018-11-23 12:02:30,749 INFO L273 TraceCheckUtils]: 89: Hoare triple {8388#false} ~cond := #in~cond; {8388#false} is VALID [2018-11-23 12:02:30,749 INFO L273 TraceCheckUtils]: 90: Hoare triple {8388#false} assume 0 == ~cond; {8388#false} is VALID [2018-11-23 12:02:30,750 INFO L273 TraceCheckUtils]: 91: Hoare triple {8388#false} assume !false; {8388#false} is VALID [2018-11-23 12:02:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-23 12:02:30,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:30,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:02:30,776 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:02:30,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:30,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:02:30,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:30,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:02:30,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:02:30,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:30,813 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 19 states. [2018-11-23 12:02:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,478 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-11-23 12:02:31,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:02:31,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:02:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 12:02:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 12:02:31,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-23 12:02:32,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:32,119 INFO L225 Difference]: With dead ends: 179 [2018-11-23 12:02:32,119 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:02:32,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:02:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 12:02:32,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:32,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 12:02:32,225 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 12:02:32,225 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 12:02:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,228 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-23 12:02:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 12:02:32,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,228 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 12:02:32,229 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 12:02:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,230 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-23 12:02:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-23 12:02:32,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:32,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:02:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-11-23 12:02:32,234 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 92 [2018-11-23 12:02:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-11-23 12:02:32,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:02:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-11-23 12:02:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:02:32,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:32,235 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:32,235 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:32,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1861215782, now seen corresponding path program 16 times [2018-11-23 12:02:32,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:32,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2018-11-23 12:02:33,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9321#true} is VALID [2018-11-23 12:02:33,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2018-11-23 12:02:33,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #76#return; {9321#true} is VALID [2018-11-23 12:02:33,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret6 := main(); {9321#true} is VALID [2018-11-23 12:02:33,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {9321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9323#(= main_~i~0 0)} is VALID [2018-11-23 12:02:33,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {9323#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9324#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {9324#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9325#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {9325#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9326#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {9326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9327#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {9327#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9328#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {9328#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9329#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {9329#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9330#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {9330#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9331#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {9331#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9332#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {9332#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9333#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {9333#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9334#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:33,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {9334#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9335#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:33,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {9335#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9336#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:33,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {9336#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9337#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:33,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {9337#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9338#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:33,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {9338#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9339#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:33,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {9339#(<= main_~i~0 16)} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 12:02:33,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {9322#false} ~i~0 := 0; {9322#false} is VALID [2018-11-23 12:02:33,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,191 INFO L273 TraceCheckUtils]: 29: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,191 INFO L273 TraceCheckUtils]: 30: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,191 INFO L273 TraceCheckUtils]: 32: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,192 INFO L273 TraceCheckUtils]: 33: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,192 INFO L273 TraceCheckUtils]: 34: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,192 INFO L273 TraceCheckUtils]: 36: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,192 INFO L273 TraceCheckUtils]: 37: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,193 INFO L273 TraceCheckUtils]: 38: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,193 INFO L273 TraceCheckUtils]: 42: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,194 INFO L273 TraceCheckUtils]: 45: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,194 INFO L273 TraceCheckUtils]: 46: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,194 INFO L273 TraceCheckUtils]: 47: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,194 INFO L273 TraceCheckUtils]: 49: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 50: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 51: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 52: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 53: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 54: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 55: Hoare triple {9322#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 56: Hoare triple {9322#false} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 57: Hoare triple {9322#false} ~i~0 := 0; {9322#false} is VALID [2018-11-23 12:02:33,195 INFO L273 TraceCheckUtils]: 58: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 59: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 60: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 61: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 62: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 63: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 64: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 65: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,196 INFO L273 TraceCheckUtils]: 66: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 67: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 68: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 69: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 70: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 71: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 72: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 73: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 74: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 76: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 79: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 80: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 81: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 82: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 83: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,198 INFO L273 TraceCheckUtils]: 84: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 85: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 86: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 87: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 88: Hoare triple {9322#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 89: Hoare triple {9322#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 90: Hoare triple {9322#false} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 91: Hoare triple {9322#false} havoc ~x~0;~x~0 := 0; {9322#false} is VALID [2018-11-23 12:02:33,199 INFO L273 TraceCheckUtils]: 92: Hoare triple {9322#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9322#false} is VALID [2018-11-23 12:02:33,200 INFO L256 TraceCheckUtils]: 93: Hoare triple {9322#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {9322#false} is VALID [2018-11-23 12:02:33,200 INFO L273 TraceCheckUtils]: 94: Hoare triple {9322#false} ~cond := #in~cond; {9322#false} is VALID [2018-11-23 12:02:33,200 INFO L273 TraceCheckUtils]: 95: Hoare triple {9322#false} assume 0 == ~cond; {9322#false} is VALID [2018-11-23 12:02:33,200 INFO L273 TraceCheckUtils]: 96: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2018-11-23 12:02:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-23 12:02:33,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:33,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:33,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:33,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:33,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2018-11-23 12:02:33,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9321#true} is VALID [2018-11-23 12:02:33,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2018-11-23 12:02:33,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #76#return; {9321#true} is VALID [2018-11-23 12:02:33,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret6 := main(); {9321#true} is VALID [2018-11-23 12:02:33,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {9321#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9321#true} is VALID [2018-11-23 12:02:33,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 10: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {9321#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9321#true} is VALID [2018-11-23 12:02:33,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {9321#true} assume !(~i~0 < 100000); {9321#true} is VALID [2018-11-23 12:02:33,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {9321#true} ~i~0 := 0; {9321#true} is VALID [2018-11-23 12:02:33,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 29: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 38: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 40: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,590 INFO L273 TraceCheckUtils]: 41: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 43: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 44: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 45: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 46: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 47: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 48: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 49: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,592 INFO L273 TraceCheckUtils]: 51: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,592 INFO L273 TraceCheckUtils]: 53: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,592 INFO L273 TraceCheckUtils]: 54: Hoare triple {9321#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {9321#true} is VALID [2018-11-23 12:02:33,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {9321#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9321#true} is VALID [2018-11-23 12:02:33,592 INFO L273 TraceCheckUtils]: 56: Hoare triple {9321#true} assume !(~i~0 < 100000); {9321#true} is VALID [2018-11-23 12:02:33,597 INFO L273 TraceCheckUtils]: 57: Hoare triple {9321#true} ~i~0 := 0; {9514#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,597 INFO L273 TraceCheckUtils]: 58: Hoare triple {9514#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9514#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,598 INFO L273 TraceCheckUtils]: 59: Hoare triple {9514#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9324#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,598 INFO L273 TraceCheckUtils]: 60: Hoare triple {9324#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9324#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,599 INFO L273 TraceCheckUtils]: 61: Hoare triple {9324#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9325#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {9325#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9325#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,599 INFO L273 TraceCheckUtils]: 63: Hoare triple {9325#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9326#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,600 INFO L273 TraceCheckUtils]: 64: Hoare triple {9326#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9326#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {9326#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9327#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,601 INFO L273 TraceCheckUtils]: 66: Hoare triple {9327#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9327#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,602 INFO L273 TraceCheckUtils]: 67: Hoare triple {9327#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9328#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,602 INFO L273 TraceCheckUtils]: 68: Hoare triple {9328#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9328#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,603 INFO L273 TraceCheckUtils]: 69: Hoare triple {9328#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9329#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,603 INFO L273 TraceCheckUtils]: 70: Hoare triple {9329#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9329#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,604 INFO L273 TraceCheckUtils]: 71: Hoare triple {9329#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9330#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,605 INFO L273 TraceCheckUtils]: 72: Hoare triple {9330#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9330#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,605 INFO L273 TraceCheckUtils]: 73: Hoare triple {9330#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9331#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,606 INFO L273 TraceCheckUtils]: 74: Hoare triple {9331#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9331#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,607 INFO L273 TraceCheckUtils]: 75: Hoare triple {9331#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9332#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,607 INFO L273 TraceCheckUtils]: 76: Hoare triple {9332#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9332#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,608 INFO L273 TraceCheckUtils]: 77: Hoare triple {9332#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9333#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,609 INFO L273 TraceCheckUtils]: 78: Hoare triple {9333#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9333#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,609 INFO L273 TraceCheckUtils]: 79: Hoare triple {9333#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9334#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:33,610 INFO L273 TraceCheckUtils]: 80: Hoare triple {9334#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9334#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:33,611 INFO L273 TraceCheckUtils]: 81: Hoare triple {9334#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9335#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:33,611 INFO L273 TraceCheckUtils]: 82: Hoare triple {9335#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9335#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:33,612 INFO L273 TraceCheckUtils]: 83: Hoare triple {9335#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9336#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:33,613 INFO L273 TraceCheckUtils]: 84: Hoare triple {9336#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9336#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:33,613 INFO L273 TraceCheckUtils]: 85: Hoare triple {9336#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9337#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:33,614 INFO L273 TraceCheckUtils]: 86: Hoare triple {9337#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9337#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:33,615 INFO L273 TraceCheckUtils]: 87: Hoare triple {9337#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9338#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:33,615 INFO L273 TraceCheckUtils]: 88: Hoare triple {9338#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {9338#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:33,616 INFO L273 TraceCheckUtils]: 89: Hoare triple {9338#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9339#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:33,617 INFO L273 TraceCheckUtils]: 90: Hoare triple {9339#(<= main_~i~0 16)} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 12:02:33,617 INFO L273 TraceCheckUtils]: 91: Hoare triple {9322#false} havoc ~x~0;~x~0 := 0; {9322#false} is VALID [2018-11-23 12:02:33,617 INFO L273 TraceCheckUtils]: 92: Hoare triple {9322#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {9322#false} is VALID [2018-11-23 12:02:33,617 INFO L256 TraceCheckUtils]: 93: Hoare triple {9322#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {9322#false} is VALID [2018-11-23 12:02:33,617 INFO L273 TraceCheckUtils]: 94: Hoare triple {9322#false} ~cond := #in~cond; {9322#false} is VALID [2018-11-23 12:02:33,618 INFO L273 TraceCheckUtils]: 95: Hoare triple {9322#false} assume 0 == ~cond; {9322#false} is VALID [2018-11-23 12:02:33,618 INFO L273 TraceCheckUtils]: 96: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2018-11-23 12:02:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 12:02:33,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:33,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:02:33,643 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-23 12:02:33,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:33,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:02:33,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:02:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:02:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:02:33,722 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 20 states. [2018-11-23 12:02:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,578 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-23 12:02:34,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:02:34,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-23 12:02:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2018-11-23 12:02:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2018-11-23 12:02:34,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 134 transitions. [2018-11-23 12:02:34,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:34,894 INFO L225 Difference]: With dead ends: 188 [2018-11-23 12:02:34,894 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 12:02:34,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:02:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 12:02:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-23 12:02:34,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:34,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-23 12:02:34,932 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-23 12:02:34,932 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-23 12:02:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,934 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 12:02:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 12:02:34,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,935 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-23 12:02:34,935 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-23 12:02:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,936 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-23 12:02:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2018-11-23 12:02:34,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:34,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:02:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-11-23 12:02:34,939 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 97 [2018-11-23 12:02:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:34,940 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-11-23 12:02:34,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:02:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-23 12:02:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 12:02:34,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:34,941 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:34,941 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:34,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1207301786, now seen corresponding path program 17 times [2018-11-23 12:02:34,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:34,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {10303#true} call ULTIMATE.init(); {10303#true} is VALID [2018-11-23 12:02:35,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {10303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10303#true} is VALID [2018-11-23 12:02:35,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {10303#true} assume true; {10303#true} is VALID [2018-11-23 12:02:35,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10303#true} {10303#true} #76#return; {10303#true} is VALID [2018-11-23 12:02:35,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {10303#true} call #t~ret6 := main(); {10303#true} is VALID [2018-11-23 12:02:35,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {10303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10305#(= main_~i~0 0)} is VALID [2018-11-23 12:02:35,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {10305#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10306#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:35,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {10306#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10307#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:35,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {10307#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10308#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:35,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {10308#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10309#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:35,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {10309#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10310#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:35,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {10310#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10311#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:35,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {10311#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10312#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:35,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {10312#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10313#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:35,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {10313#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10314#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:35,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {10314#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10315#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:35,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {10315#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10316#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:35,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {10316#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10317#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:35,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {10317#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10318#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:35,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {10318#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10319#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:35,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {10319#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10320#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:35,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {10320#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10321#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:35,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {10321#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10322#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:35,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {10322#(<= main_~i~0 17)} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:02:35,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {10304#false} ~i~0 := 0; {10304#false} is VALID [2018-11-23 12:02:35,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,945 INFO L273 TraceCheckUtils]: 29: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,945 INFO L273 TraceCheckUtils]: 31: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,945 INFO L273 TraceCheckUtils]: 32: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,946 INFO L273 TraceCheckUtils]: 33: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,947 INFO L273 TraceCheckUtils]: 39: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,947 INFO L273 TraceCheckUtils]: 40: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 44: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 45: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 47: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 48: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 49: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 50: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 51: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,948 INFO L273 TraceCheckUtils]: 52: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 53: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 54: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 55: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 56: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 57: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 58: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 59: Hoare triple {10304#false} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 60: Hoare triple {10304#false} ~i~0 := 0; {10304#false} is VALID [2018-11-23 12:02:35,949 INFO L273 TraceCheckUtils]: 61: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 62: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 63: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 64: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 65: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 66: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 67: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 68: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,950 INFO L273 TraceCheckUtils]: 69: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 70: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 71: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 72: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 73: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 74: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 75: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 76: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 77: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,951 INFO L273 TraceCheckUtils]: 78: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 79: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 80: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 81: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 82: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 83: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 84: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 85: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,952 INFO L273 TraceCheckUtils]: 86: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 87: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 88: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 89: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 90: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 91: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 92: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 93: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 94: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:02:35,953 INFO L273 TraceCheckUtils]: 95: Hoare triple {10304#false} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:02:35,954 INFO L273 TraceCheckUtils]: 96: Hoare triple {10304#false} havoc ~x~0;~x~0 := 0; {10304#false} is VALID [2018-11-23 12:02:35,954 INFO L273 TraceCheckUtils]: 97: Hoare triple {10304#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10304#false} is VALID [2018-11-23 12:02:35,954 INFO L256 TraceCheckUtils]: 98: Hoare triple {10304#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {10304#false} is VALID [2018-11-23 12:02:35,954 INFO L273 TraceCheckUtils]: 99: Hoare triple {10304#false} ~cond := #in~cond; {10304#false} is VALID [2018-11-23 12:02:35,954 INFO L273 TraceCheckUtils]: 100: Hoare triple {10304#false} assume 0 == ~cond; {10304#false} is VALID [2018-11-23 12:02:35,954 INFO L273 TraceCheckUtils]: 101: Hoare triple {10304#false} assume !false; {10304#false} is VALID [2018-11-23 12:02:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-23 12:02:35,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:35,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:35,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:54,700 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:03:54,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:54,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:55,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {10303#true} call ULTIMATE.init(); {10303#true} is VALID [2018-11-23 12:03:55,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {10303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10303#true} is VALID [2018-11-23 12:03:55,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {10303#true} assume true; {10303#true} is VALID [2018-11-23 12:03:55,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10303#true} {10303#true} #76#return; {10303#true} is VALID [2018-11-23 12:03:55,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {10303#true} call #t~ret6 := main(); {10303#true} is VALID [2018-11-23 12:03:55,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {10303#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10341#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:55,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {10341#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10306#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:55,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {10306#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10307#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:55,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {10307#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10308#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:55,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {10308#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10309#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:55,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {10309#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10310#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:55,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {10310#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10311#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:55,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {10311#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10312#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:55,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {10312#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10313#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:55,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {10313#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10314#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:55,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {10314#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10315#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:55,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {10315#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10316#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:55,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {10316#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10317#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:55,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {10317#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10318#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:55,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {10318#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10319#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:55,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {10319#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10320#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:55,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {10320#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10321#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:55,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {10321#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10322#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:55,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {10322#(<= main_~i~0 17)} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:03:55,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {10304#false} ~i~0 := 0; {10304#false} is VALID [2018-11-23 12:03:55,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,086 INFO L273 TraceCheckUtils]: 32: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,086 INFO L273 TraceCheckUtils]: 35: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,086 INFO L273 TraceCheckUtils]: 36: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,086 INFO L273 TraceCheckUtils]: 37: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 38: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 39: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 40: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 41: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 42: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 43: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,087 INFO L273 TraceCheckUtils]: 44: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,088 INFO L273 TraceCheckUtils]: 45: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,088 INFO L273 TraceCheckUtils]: 46: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,088 INFO L273 TraceCheckUtils]: 47: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,088 INFO L273 TraceCheckUtils]: 48: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,088 INFO L273 TraceCheckUtils]: 49: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,088 INFO L273 TraceCheckUtils]: 50: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,088 INFO L273 TraceCheckUtils]: 51: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,089 INFO L273 TraceCheckUtils]: 52: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,089 INFO L273 TraceCheckUtils]: 53: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,089 INFO L273 TraceCheckUtils]: 55: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,089 INFO L273 TraceCheckUtils]: 56: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,089 INFO L273 TraceCheckUtils]: 57: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {10304#false} is VALID [2018-11-23 12:03:55,090 INFO L273 TraceCheckUtils]: 58: Hoare triple {10304#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10304#false} is VALID [2018-11-23 12:03:55,090 INFO L273 TraceCheckUtils]: 59: Hoare triple {10304#false} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:03:55,090 INFO L273 TraceCheckUtils]: 60: Hoare triple {10304#false} ~i~0 := 0; {10304#false} is VALID [2018-11-23 12:03:55,090 INFO L273 TraceCheckUtils]: 61: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,090 INFO L273 TraceCheckUtils]: 62: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,090 INFO L273 TraceCheckUtils]: 63: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,090 INFO L273 TraceCheckUtils]: 64: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,091 INFO L273 TraceCheckUtils]: 65: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,091 INFO L273 TraceCheckUtils]: 66: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,091 INFO L273 TraceCheckUtils]: 67: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,091 INFO L273 TraceCheckUtils]: 68: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,091 INFO L273 TraceCheckUtils]: 69: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,091 INFO L273 TraceCheckUtils]: 70: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,091 INFO L273 TraceCheckUtils]: 71: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,092 INFO L273 TraceCheckUtils]: 72: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,092 INFO L273 TraceCheckUtils]: 73: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,092 INFO L273 TraceCheckUtils]: 74: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,092 INFO L273 TraceCheckUtils]: 75: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,092 INFO L273 TraceCheckUtils]: 76: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,092 INFO L273 TraceCheckUtils]: 77: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,093 INFO L273 TraceCheckUtils]: 78: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,093 INFO L273 TraceCheckUtils]: 79: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,093 INFO L273 TraceCheckUtils]: 80: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,093 INFO L273 TraceCheckUtils]: 81: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,093 INFO L273 TraceCheckUtils]: 82: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,093 INFO L273 TraceCheckUtils]: 83: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,093 INFO L273 TraceCheckUtils]: 84: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,094 INFO L273 TraceCheckUtils]: 85: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,094 INFO L273 TraceCheckUtils]: 86: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,094 INFO L273 TraceCheckUtils]: 87: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,094 INFO L273 TraceCheckUtils]: 88: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,094 INFO L273 TraceCheckUtils]: 89: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,094 INFO L273 TraceCheckUtils]: 90: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,094 INFO L273 TraceCheckUtils]: 91: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,095 INFO L273 TraceCheckUtils]: 92: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,095 INFO L273 TraceCheckUtils]: 93: Hoare triple {10304#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {10304#false} is VALID [2018-11-23 12:03:55,095 INFO L273 TraceCheckUtils]: 94: Hoare triple {10304#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10304#false} is VALID [2018-11-23 12:03:55,095 INFO L273 TraceCheckUtils]: 95: Hoare triple {10304#false} assume !(~i~0 < 100000); {10304#false} is VALID [2018-11-23 12:03:55,095 INFO L273 TraceCheckUtils]: 96: Hoare triple {10304#false} havoc ~x~0;~x~0 := 0; {10304#false} is VALID [2018-11-23 12:03:55,095 INFO L273 TraceCheckUtils]: 97: Hoare triple {10304#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {10304#false} is VALID [2018-11-23 12:03:55,095 INFO L256 TraceCheckUtils]: 98: Hoare triple {10304#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {10304#false} is VALID [2018-11-23 12:03:55,096 INFO L273 TraceCheckUtils]: 99: Hoare triple {10304#false} ~cond := #in~cond; {10304#false} is VALID [2018-11-23 12:03:55,096 INFO L273 TraceCheckUtils]: 100: Hoare triple {10304#false} assume 0 == ~cond; {10304#false} is VALID [2018-11-23 12:03:55,096 INFO L273 TraceCheckUtils]: 101: Hoare triple {10304#false} assume !false; {10304#false} is VALID [2018-11-23 12:03:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-23 12:03:55,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:55,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:03:55,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-11-23 12:03:55,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:55,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:03:55,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:55,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:03:55,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:03:55,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:55,169 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 21 states. [2018-11-23 12:03:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:55,837 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-11-23 12:03:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:03:55,837 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-11-23 12:03:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-23 12:03:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:03:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 139 transitions. [2018-11-23 12:03:55,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 139 transitions. [2018-11-23 12:03:56,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:56,017 INFO L225 Difference]: With dead ends: 197 [2018-11-23 12:03:56,017 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 12:03:56,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:03:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 12:03:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 12:03:56,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:56,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-23 12:03:56,065 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-23 12:03:56,065 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-23 12:03:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:56,068 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-23 12:03:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-23 12:03:56,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:56,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:56,069 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-23 12:03:56,069 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-23 12:03:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:56,070 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-23 12:03:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-23 12:03:56,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:56,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:56,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:56,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:03:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2018-11-23 12:03:56,072 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 102 [2018-11-23 12:03:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:56,072 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2018-11-23 12:03:56,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:03:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2018-11-23 12:03:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 12:03:56,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:56,073 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:56,074 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:56,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1112684590, now seen corresponding path program 18 times [2018-11-23 12:03:56,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:56,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:56,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:56,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:56,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:56,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {11333#true} call ULTIMATE.init(); {11333#true} is VALID [2018-11-23 12:03:56,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {11333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11333#true} is VALID [2018-11-23 12:03:56,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {11333#true} assume true; {11333#true} is VALID [2018-11-23 12:03:56,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11333#true} {11333#true} #76#return; {11333#true} is VALID [2018-11-23 12:03:56,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {11333#true} call #t~ret6 := main(); {11333#true} is VALID [2018-11-23 12:03:56,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {11333#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11335#(= main_~i~0 0)} is VALID [2018-11-23 12:03:56,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {11335#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11336#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:56,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {11336#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11337#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:56,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {11337#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11338#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:56,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {11338#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11339#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:56,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {11339#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11340#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:56,453 INFO L273 TraceCheckUtils]: 11: Hoare triple {11340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11341#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:56,454 INFO L273 TraceCheckUtils]: 12: Hoare triple {11341#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11342#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:56,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {11342#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11343#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:56,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {11343#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11344#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:56,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {11344#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11345#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:56,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {11345#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11346#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:56,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {11346#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11347#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:56,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {11347#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11348#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:56,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {11348#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11349#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:56,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {11349#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11350#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:56,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {11350#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11351#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:56,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {11351#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11352#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:56,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {11352#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11353#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:56,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {11353#(<= main_~i~0 18)} assume !(~i~0 < 100000); {11334#false} is VALID [2018-11-23 12:03:56,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {11334#false} ~i~0 := 0; {11334#false} is VALID [2018-11-23 12:03:56,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,466 INFO L273 TraceCheckUtils]: 30: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,466 INFO L273 TraceCheckUtils]: 31: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,467 INFO L273 TraceCheckUtils]: 34: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,467 INFO L273 TraceCheckUtils]: 35: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,467 INFO L273 TraceCheckUtils]: 36: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,467 INFO L273 TraceCheckUtils]: 37: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,468 INFO L273 TraceCheckUtils]: 38: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,468 INFO L273 TraceCheckUtils]: 39: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,468 INFO L273 TraceCheckUtils]: 40: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,468 INFO L273 TraceCheckUtils]: 41: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,468 INFO L273 TraceCheckUtils]: 42: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 44: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 46: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 47: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 49: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 50: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 51: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,469 INFO L273 TraceCheckUtils]: 52: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 53: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 55: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 56: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 57: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 59: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem1; {11334#false} is VALID [2018-11-23 12:03:56,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {11334#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {11334#false} assume !(~i~0 < 100000); {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 63: Hoare triple {11334#false} ~i~0 := 0; {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 66: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 67: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 68: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,471 INFO L273 TraceCheckUtils]: 69: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 70: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 71: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 72: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 73: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 74: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 75: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 76: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,472 INFO L273 TraceCheckUtils]: 78: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 79: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 80: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 81: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 82: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 83: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 84: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 85: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 86: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,473 INFO L273 TraceCheckUtils]: 87: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 88: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 89: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 90: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 91: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 92: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 93: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,474 INFO L273 TraceCheckUtils]: 95: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L273 TraceCheckUtils]: 96: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L273 TraceCheckUtils]: 97: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L273 TraceCheckUtils]: 98: Hoare triple {11334#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem3 + ~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~mem3; {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L273 TraceCheckUtils]: 99: Hoare triple {11334#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L273 TraceCheckUtils]: 100: Hoare triple {11334#false} assume !(~i~0 < 100000); {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L273 TraceCheckUtils]: 101: Hoare triple {11334#false} havoc ~x~0;~x~0 := 0; {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L273 TraceCheckUtils]: 102: Hoare triple {11334#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~x~0, 4); {11334#false} is VALID [2018-11-23 12:03:56,475 INFO L256 TraceCheckUtils]: 103: Hoare triple {11334#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {11334#false} is VALID [2018-11-23 12:03:56,476 INFO L273 TraceCheckUtils]: 104: Hoare triple {11334#false} ~cond := #in~cond; {11334#false} is VALID [2018-11-23 12:03:56,476 INFO L273 TraceCheckUtils]: 105: Hoare triple {11334#false} assume 0 == ~cond; {11334#false} is VALID [2018-11-23 12:03:56,476 INFO L273 TraceCheckUtils]: 106: Hoare triple {11334#false} assume !false; {11334#false} is VALID [2018-11-23 12:03:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-23 12:03:56,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:56,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:56,491 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE