java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:43:12,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:43:12,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:43:12,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:43:12,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:43:12,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:43:12,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:43:12,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:43:12,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:43:12,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:43:12,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:43:12,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:43:12,874 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:43:12,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:43:12,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:43:12,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:43:12,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:43:12,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:43:12,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:43:12,884 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:43:12,885 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:43:12,887 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:43:12,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:43:12,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:43:12,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:43:12,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:43:12,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:43:12,893 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:43:12,894 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:43:12,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:43:12,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:43:12,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:43:12,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:43:12,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:43:12,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:43:12,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:43:12,900 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-18 22:43:12,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:43:12,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:43:12,918 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:43:12,918 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:43:12,919 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:43:12,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:43:12,919 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:43:12,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:43:12,920 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:43:12,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:43:12,920 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:43:12,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:43:12,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:43:12,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:43:12,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:43:12,921 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:43:12,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:43:12,922 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:43:12,922 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:43:12,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:43:12,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:43:12,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:43:12,923 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:43:12,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:43:12,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:43:12,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:43:12,924 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:43:12,924 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:43:12,924 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:43:12,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:43:12,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:43:12,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:43:12,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:43:12,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:43:12,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:43:12,993 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:43:12,993 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-18 22:43:13,056 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34c45996b/ff0cb8be3a7a455da8420c33603087c7/FLAG336ee0c54 [2018-11-18 22:43:13,532 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:43:13,532 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-18 22:43:13,540 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34c45996b/ff0cb8be3a7a455da8420c33603087c7/FLAG336ee0c54 [2018-11-18 22:43:13,862 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34c45996b/ff0cb8be3a7a455da8420c33603087c7 [2018-11-18 22:43:13,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:43:13,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:43:13,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:13,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:43:13,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:43:13,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:13" (1/1) ... [2018-11-18 22:43:13,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f38770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:13, skipping insertion in model container [2018-11-18 22:43:13,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:43:13" (1/1) ... [2018-11-18 22:43:13,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:43:13,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:43:14,148 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,153 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:43:14,181 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:43:14,216 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:43:14,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14 WrapperNode [2018-11-18 22:43:14,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:43:14,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:43:14,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:43:14,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (1/1) ... [2018-11-18 22:43:14,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:43:14,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:43:14,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:43:14,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:43:14,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (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-18 22:43:14,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:43:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:43:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:43:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:43:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:43:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:43:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:43:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:43:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:43:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:43:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:43:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:43:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:43:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:43:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:43:14,976 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:43:14,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:14 BoogieIcfgContainer [2018-11-18 22:43:14,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:43:14,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:43:14,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:43:14,982 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:43:14,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:43:13" (1/3) ... [2018-11-18 22:43:14,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4748307b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:14, skipping insertion in model container [2018-11-18 22:43:14,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:43:14" (2/3) ... [2018-11-18 22:43:14,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4748307b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:43:14, skipping insertion in model container [2018-11-18 22:43:14,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:43:14" (3/3) ... [2018-11-18 22:43:14,986 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy1_false-unreach-call_ground.i [2018-11-18 22:43:14,997 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:43:15,006 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:43:15,023 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:43:15,056 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:43:15,057 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:43:15,057 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:43:15,058 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:43:15,058 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:43:15,058 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:43:15,059 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:43:15,059 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:43:15,059 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:43:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 22:43:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 22:43:15,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:15,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:15,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:15,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-11-18 22:43:15,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:15,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-18 22:43:15,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-18 22:43:15,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-18 22:43:15,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #66#return; {33#true} is VALID [2018-11-18 22:43:15,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret8 := main(); {33#true} is VALID [2018-11-18 22:43:15,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {33#true} is VALID [2018-11-18 22:43:15,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-18 22:43:15,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~i~0;~i~0 := 0; {34#false} is VALID [2018-11-18 22:43:15,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !true; {34#false} is VALID [2018-11-18 22:43:15,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} havoc ~x~0;~x~0 := 0; {34#false} is VALID [2018-11-18 22:43:15,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-18 22:43:15,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {34#false} is VALID [2018-11-18 22:43:15,261 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {34#false} is VALID [2018-11-18 22:43:15,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-18 22:43:15,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-18 22:43:15,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-18 22:43:15,265 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-18 22:43:15,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:15,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:43:15,273 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:43:15,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:15,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:43:15,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:15,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:43:15,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:43:15,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:43:15,391 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-18 22:43:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:15,614 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-18 22:43:15,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:43:15,614 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:43:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-18 22:43:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:43:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-18 22:43:15,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-18 22:43:15,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:15,966 INFO L225 Difference]: With dead ends: 51 [2018-11-18 22:43:15,966 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 22:43:15,970 INFO L604 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-18 22:43:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 22:43:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 22:43:16,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:16,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-18 22:43:16,010 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 22:43:16,010 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 22:43:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,014 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-18 22:43:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-18 22:43:16,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:16,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:16,015 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 22:43:16,016 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 22:43:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,020 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-18 22:43:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-18 22:43:16,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:16,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:16,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:16,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:43:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-18 22:43:16,026 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-18 22:43:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:16,026 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-18 22:43:16,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:43:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-18 22:43:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:43:16,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:16,027 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:16,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:16,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-11-18 22:43:16,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:16,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:16,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {185#true} is VALID [2018-11-18 22:43:16,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {185#true} is VALID [2018-11-18 22:43:16,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2018-11-18 22:43:16,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #66#return; {185#true} is VALID [2018-11-18 22:43:16,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret8 := main(); {185#true} is VALID [2018-11-18 22:43:16,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {185#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {187#(= main_~a~0 0)} is VALID [2018-11-18 22:43:16,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {187#(= main_~a~0 0)} assume true; {187#(= main_~a~0 0)} is VALID [2018-11-18 22:43:16,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {187#(= main_~a~0 0)} assume !(~a~0 < 100000); {186#false} is VALID [2018-11-18 22:43:16,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {186#false} havoc ~i~0;~i~0 := 0; {186#false} is VALID [2018-11-18 22:43:16,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {186#false} assume true; {186#false} is VALID [2018-11-18 22:43:16,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {186#false} assume !(~i~0 < 100000); {186#false} is VALID [2018-11-18 22:43:16,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {186#false} havoc ~x~0;~x~0 := 0; {186#false} is VALID [2018-11-18 22:43:16,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {186#false} assume true; {186#false} is VALID [2018-11-18 22:43:16,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {186#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {186#false} is VALID [2018-11-18 22:43:16,156 INFO L256 TraceCheckUtils]: 14: Hoare triple {186#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {186#false} is VALID [2018-11-18 22:43:16,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {186#false} ~cond := #in~cond; {186#false} is VALID [2018-11-18 22:43:16,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {186#false} assume 0 == ~cond; {186#false} is VALID [2018-11-18 22:43:16,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {186#false} assume !false; {186#false} is VALID [2018-11-18 22:43:16,159 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-18 22:43:16,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:16,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:43:16,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:43:16,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:16,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:43:16,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:16,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:43:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:43:16,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:16,285 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2018-11-18 22:43:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,483 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-18 22:43:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:43:16,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:43:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-18 22:43:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-18 22:43:16,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-18 22:43:16,839 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-18 22:43:16,840 INFO L225 Difference]: With dead ends: 44 [2018-11-18 22:43:16,841 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 22:43:16,842 INFO L604 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-18 22:43:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 22:43:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-18 22:43:16,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:16,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-18 22:43:16,892 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-18 22:43:16,893 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-18 22:43:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,896 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-18 22:43:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-18 22:43:16,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:16,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:16,898 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-18 22:43:16,899 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-18 22:43:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:16,903 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-18 22:43:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-18 22:43:16,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:16,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:16,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:16,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:43:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-18 22:43:16,908 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-18 22:43:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:16,909 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-18 22:43:16,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:43:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 22:43:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 22:43:16,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:16,911 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:16,911 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:16,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:16,911 INFO L82 PathProgramCache]: Analyzing trace with hash -714418193, now seen corresponding path program 1 times [2018-11-18 22:43:16,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:16,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:16,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:17,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {341#true} is VALID [2018-11-18 22:43:17,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {341#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {341#true} is VALID [2018-11-18 22:43:17,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#true} assume true; {341#true} is VALID [2018-11-18 22:43:17,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {341#true} {341#true} #66#return; {341#true} is VALID [2018-11-18 22:43:17,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {341#true} call #t~ret8 := main(); {341#true} is VALID [2018-11-18 22:43:17,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {341#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {341#true} is VALID [2018-11-18 22:43:17,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {341#true} assume true; {341#true} is VALID [2018-11-18 22:43:17,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {341#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {341#true} is VALID [2018-11-18 22:43:17,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {341#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {341#true} is VALID [2018-11-18 22:43:17,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {341#true} assume true; {341#true} is VALID [2018-11-18 22:43:17,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {341#true} assume !(~a~0 < 100000); {341#true} is VALID [2018-11-18 22:43:17,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {341#true} havoc ~i~0;~i~0 := 0; {343#(= main_~i~0 0)} is VALID [2018-11-18 22:43:17,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#(= main_~i~0 0)} assume true; {343#(= main_~i~0 0)} is VALID [2018-11-18 22:43:17,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#(= main_~i~0 0)} assume !(~i~0 < 100000); {342#false} is VALID [2018-11-18 22:43:17,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {342#false} havoc ~x~0;~x~0 := 0; {342#false} is VALID [2018-11-18 22:43:17,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {342#false} assume true; {342#false} is VALID [2018-11-18 22:43:17,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {342#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {342#false} is VALID [2018-11-18 22:43:17,027 INFO L256 TraceCheckUtils]: 17: Hoare triple {342#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {342#false} is VALID [2018-11-18 22:43:17,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {342#false} ~cond := #in~cond; {342#false} is VALID [2018-11-18 22:43:17,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {342#false} assume 0 == ~cond; {342#false} is VALID [2018-11-18 22:43:17,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {342#false} assume !false; {342#false} is VALID [2018-11-18 22:43:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:43:17,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:43:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:43:17,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:43:17,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:17,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:43:17,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:17,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:43:17,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:43:17,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:43:17,087 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2018-11-18 22:43:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,270 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-18 22:43:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:43:17,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 22:43:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-18 22:43:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:43:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-18 22:43:17,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-18 22:43:17,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:17,381 INFO L225 Difference]: With dead ends: 42 [2018-11-18 22:43:17,381 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 22:43:17,382 INFO L604 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-18 22:43:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 22:43:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-18 22:43:17,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:17,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-18 22:43:17,430 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-18 22:43:17,430 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-18 22:43:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,433 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-18 22:43:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-18 22:43:17,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,434 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-18 22:43:17,434 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-18 22:43:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:17,437 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-18 22:43:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-18 22:43:17,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:17,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:17,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:17,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:43:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 22:43:17,441 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-11-18 22:43:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:17,442 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 22:43:17,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:43:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 22:43:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:43:17,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:17,443 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:17,444 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:17,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-11-18 22:43:17,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:17,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:17,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:17,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:17,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-18 22:43:17,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {502#true} is VALID [2018-11-18 22:43:17,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-18 22:43:17,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #66#return; {502#true} is VALID [2018-11-18 22:43:17,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret8 := main(); {502#true} is VALID [2018-11-18 22:43:17,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {504#(= main_~a~0 0)} is VALID [2018-11-18 22:43:17,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#(= main_~a~0 0)} assume true; {504#(= main_~a~0 0)} is VALID [2018-11-18 22:43:17,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {504#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {504#(= main_~a~0 0)} is VALID [2018-11-18 22:43:17,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {504#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {505#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:17,831 INFO L273 TraceCheckUtils]: 9: Hoare triple {505#(<= main_~a~0 1)} assume true; {505#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:17,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {505#(<= main_~a~0 1)} assume !(~a~0 < 100000); {503#false} is VALID [2018-11-18 22:43:17,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#false} havoc ~i~0;~i~0 := 0; {503#false} is VALID [2018-11-18 22:43:17,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#false} assume true; {503#false} is VALID [2018-11-18 22:43:17,832 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {503#false} is VALID [2018-11-18 22:43:17,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {503#false} is VALID [2018-11-18 22:43:17,833 INFO L273 TraceCheckUtils]: 15: Hoare triple {503#false} assume true; {503#false} is VALID [2018-11-18 22:43:17,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {503#false} assume !(~i~0 < 100000); {503#false} is VALID [2018-11-18 22:43:17,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {503#false} havoc ~x~0;~x~0 := 0; {503#false} is VALID [2018-11-18 22:43:17,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {503#false} assume true; {503#false} is VALID [2018-11-18 22:43:17,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {503#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {503#false} is VALID [2018-11-18 22:43:17,834 INFO L256 TraceCheckUtils]: 20: Hoare triple {503#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {503#false} is VALID [2018-11-18 22:43:17,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {503#false} ~cond := #in~cond; {503#false} is VALID [2018-11-18 22:43:17,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {503#false} assume 0 == ~cond; {503#false} is VALID [2018-11-18 22:43:17,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-18 22:43:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:43:17,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:17,836 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-18 22:43:17,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:17,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:18,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2018-11-18 22:43:18,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {502#true} is VALID [2018-11-18 22:43:18,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2018-11-18 22:43:18,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #66#return; {502#true} is VALID [2018-11-18 22:43:18,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret8 := main(); {502#true} is VALID [2018-11-18 22:43:18,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {502#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {524#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:18,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {524#(<= main_~a~0 0)} assume true; {524#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:18,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {524#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {524#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:18,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {524#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {505#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {505#(<= main_~a~0 1)} assume true; {505#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {505#(<= main_~a~0 1)} assume !(~a~0 < 100000); {503#false} is VALID [2018-11-18 22:43:18,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#false} havoc ~i~0;~i~0 := 0; {503#false} is VALID [2018-11-18 22:43:18,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#false} assume true; {503#false} is VALID [2018-11-18 22:43:18,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {503#false} is VALID [2018-11-18 22:43:18,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {503#false} is VALID [2018-11-18 22:43:18,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {503#false} assume true; {503#false} is VALID [2018-11-18 22:43:18,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {503#false} assume !(~i~0 < 100000); {503#false} is VALID [2018-11-18 22:43:18,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {503#false} havoc ~x~0;~x~0 := 0; {503#false} is VALID [2018-11-18 22:43:18,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {503#false} assume true; {503#false} is VALID [2018-11-18 22:43:18,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {503#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {503#false} is VALID [2018-11-18 22:43:18,215 INFO L256 TraceCheckUtils]: 20: Hoare triple {503#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {503#false} is VALID [2018-11-18 22:43:18,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {503#false} ~cond := #in~cond; {503#false} is VALID [2018-11-18 22:43:18,216 INFO L273 TraceCheckUtils]: 22: Hoare triple {503#false} assume 0 == ~cond; {503#false} is VALID [2018-11-18 22:43:18,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {503#false} assume !false; {503#false} is VALID [2018-11-18 22:43:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:43:18,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:18,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:43:18,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-18 22:43:18,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:18,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:43:18,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:43:18,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:43:18,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:43:18,303 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-11-18 22:43:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,635 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-18 22:43:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:43:18,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-18 22:43:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:43:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-18 22:43:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:43:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-18 22:43:18,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-18 22:43:18,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:18,753 INFO L225 Difference]: With dead ends: 51 [2018-11-18 22:43:18,753 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 22:43:18,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:43:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 22:43:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-18 22:43:18,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:18,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-18 22:43:18,770 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-18 22:43:18,771 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-18 22:43:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,776 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-18 22:43:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-18 22:43:18,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,778 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-18 22:43:18,778 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-18 22:43:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:18,786 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-18 22:43:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-18 22:43:18,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:18,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:18,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:18,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:43:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-18 22:43:18,792 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-11-18 22:43:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:18,793 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-18 22:43:18,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:43:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-18 22:43:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:43:18,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:18,796 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:18,800 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:18,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1367946380, now seen corresponding path program 2 times [2018-11-18 22:43:18,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:18,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:18,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:18,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2018-11-18 22:43:18,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {756#true} is VALID [2018-11-18 22:43:18,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-18 22:43:18,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #66#return; {756#true} is VALID [2018-11-18 22:43:18,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret8 := main(); {756#true} is VALID [2018-11-18 22:43:18,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {756#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {758#(= main_~a~0 0)} is VALID [2018-11-18 22:43:18,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {758#(= main_~a~0 0)} assume true; {758#(= main_~a~0 0)} is VALID [2018-11-18 22:43:18,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {758#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {758#(= main_~a~0 0)} is VALID [2018-11-18 22:43:18,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {758#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {759#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {759#(<= main_~a~0 1)} assume true; {759#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {759#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {759#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:18,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {759#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {760#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:18,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {760#(<= main_~a~0 2)} assume true; {760#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:18,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {760#(<= main_~a~0 2)} assume !(~a~0 < 100000); {757#false} is VALID [2018-11-18 22:43:18,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {757#false} havoc ~i~0;~i~0 := 0; {757#false} is VALID [2018-11-18 22:43:18,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {757#false} assume true; {757#false} is VALID [2018-11-18 22:43:18,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {757#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {757#false} is VALID [2018-11-18 22:43:18,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {757#false} is VALID [2018-11-18 22:43:18,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {757#false} assume true; {757#false} is VALID [2018-11-18 22:43:18,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {757#false} assume !(~i~0 < 100000); {757#false} is VALID [2018-11-18 22:43:18,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {757#false} havoc ~x~0;~x~0 := 0; {757#false} is VALID [2018-11-18 22:43:18,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {757#false} assume true; {757#false} is VALID [2018-11-18 22:43:18,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {757#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {757#false} is VALID [2018-11-18 22:43:18,963 INFO L256 TraceCheckUtils]: 23: Hoare triple {757#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {757#false} is VALID [2018-11-18 22:43:18,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2018-11-18 22:43:18,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {757#false} assume 0 == ~cond; {757#false} is VALID [2018-11-18 22:43:18,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {757#false} assume !false; {757#false} is VALID [2018-11-18 22:43:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:43:18,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:18,966 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-18 22:43:18,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:19,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:19,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:19,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2018-11-18 22:43:19,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {756#true} is VALID [2018-11-18 22:43:19,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-18 22:43:19,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #66#return; {756#true} is VALID [2018-11-18 22:43:19,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret8 := main(); {756#true} is VALID [2018-11-18 22:43:19,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {756#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {756#true} is VALID [2018-11-18 22:43:19,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-18 22:43:19,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {756#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {756#true} is VALID [2018-11-18 22:43:19,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {756#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {756#true} is VALID [2018-11-18 22:43:19,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-18 22:43:19,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {756#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {756#true} is VALID [2018-11-18 22:43:19,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {756#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {756#true} is VALID [2018-11-18 22:43:19,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {756#true} assume true; {756#true} is VALID [2018-11-18 22:43:19,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {756#true} assume !(~a~0 < 100000); {756#true} is VALID [2018-11-18 22:43:19,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {756#true} havoc ~i~0;~i~0 := 0; {806#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:19,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#(<= main_~i~0 0)} assume true; {806#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:19,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {806#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {806#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:19,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {806#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {816#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:19,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {816#(<= main_~i~0 1)} assume true; {816#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:19,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {816#(<= main_~i~0 1)} assume !(~i~0 < 100000); {757#false} is VALID [2018-11-18 22:43:19,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {757#false} havoc ~x~0;~x~0 := 0; {757#false} is VALID [2018-11-18 22:43:19,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {757#false} assume true; {757#false} is VALID [2018-11-18 22:43:19,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {757#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {757#false} is VALID [2018-11-18 22:43:19,144 INFO L256 TraceCheckUtils]: 23: Hoare triple {757#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {757#false} is VALID [2018-11-18 22:43:19,144 INFO L273 TraceCheckUtils]: 24: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2018-11-18 22:43:19,144 INFO L273 TraceCheckUtils]: 25: Hoare triple {757#false} assume 0 == ~cond; {757#false} is VALID [2018-11-18 22:43:19,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {757#false} assume !false; {757#false} is VALID [2018-11-18 22:43:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 22:43:19,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-18 22:43:19,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:43:19,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:19,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:43:19,209 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-18 22:43:19,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:43:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:43:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:43:19,210 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-11-18 22:43:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,512 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-18 22:43:19,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:43:19,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:43:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:43:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-18 22:43:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:43:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-18 22:43:19,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2018-11-18 22:43:19,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:19,700 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:43:19,700 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 22:43:19,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:43:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 22:43:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-18 22:43:19,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:19,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-18 22:43:19,739 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-18 22:43:19,739 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-18 22:43:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,742 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-18 22:43:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-18 22:43:19,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:19,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:19,743 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-18 22:43:19,743 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-18 22:43:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:19,746 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-18 22:43:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-18 22:43:19,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:19,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:19,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:19,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:43:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-18 22:43:19,749 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2018-11-18 22:43:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:19,750 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-18 22:43:19,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:43:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-18 22:43:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 22:43:19,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:19,751 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:19,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:19,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1565599503, now seen corresponding path program 3 times [2018-11-18 22:43:19,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:19,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {1052#true} call ULTIMATE.init(); {1052#true} is VALID [2018-11-18 22:43:19,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {1052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1052#true} is VALID [2018-11-18 22:43:19,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-18 22:43:19,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} #66#return; {1052#true} is VALID [2018-11-18 22:43:19,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {1052#true} call #t~ret8 := main(); {1052#true} is VALID [2018-11-18 22:43:19,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {1052#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1054#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {1054#(= main_~a~0 0)} assume true; {1054#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {1054#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1054#(= main_~a~0 0)} is VALID [2018-11-18 22:43:19,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {1054#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1055#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {1055#(<= main_~a~0 1)} assume true; {1055#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {1055#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1055#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:19,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1056#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:19,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {1056#(<= main_~a~0 2)} assume true; {1056#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:19,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {1056#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1056#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:19,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {1056#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1057#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:19,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#(<= main_~a~0 3)} assume true; {1057#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:19,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {1057#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1053#false} is VALID [2018-11-18 22:43:19,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#false} havoc ~i~0;~i~0 := 0; {1053#false} is VALID [2018-11-18 22:43:19,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {1053#false} assume true; {1053#false} is VALID [2018-11-18 22:43:19,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {1053#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1053#false} is VALID [2018-11-18 22:43:19,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {1053#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1053#false} is VALID [2018-11-18 22:43:19,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {1053#false} assume true; {1053#false} is VALID [2018-11-18 22:43:19,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {1053#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1053#false} is VALID [2018-11-18 22:43:19,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {1053#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1053#false} is VALID [2018-11-18 22:43:19,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {1053#false} assume true; {1053#false} is VALID [2018-11-18 22:43:19,924 INFO L273 TraceCheckUtils]: 25: Hoare triple {1053#false} assume !(~i~0 < 100000); {1053#false} is VALID [2018-11-18 22:43:19,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {1053#false} havoc ~x~0;~x~0 := 0; {1053#false} is VALID [2018-11-18 22:43:19,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {1053#false} assume true; {1053#false} is VALID [2018-11-18 22:43:19,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {1053#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1053#false} is VALID [2018-11-18 22:43:19,925 INFO L256 TraceCheckUtils]: 29: Hoare triple {1053#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1053#false} is VALID [2018-11-18 22:43:19,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {1053#false} ~cond := #in~cond; {1053#false} is VALID [2018-11-18 22:43:19,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {1053#false} assume 0 == ~cond; {1053#false} is VALID [2018-11-18 22:43:19,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2018-11-18 22:43:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 22:43:19,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:19,928 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-18 22:43:19,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:19,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 22:43:19,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:19,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:20,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {1052#true} call ULTIMATE.init(); {1052#true} is VALID [2018-11-18 22:43:20,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {1052#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1052#true} is VALID [2018-11-18 22:43:20,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-18 22:43:20,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} #66#return; {1052#true} is VALID [2018-11-18 22:43:20,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {1052#true} call #t~ret8 := main(); {1052#true} is VALID [2018-11-18 22:43:20,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {1052#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1052#true} is VALID [2018-11-18 22:43:20,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-18 22:43:20,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {1052#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1052#true} is VALID [2018-11-18 22:43:20,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1052#true} is VALID [2018-11-18 22:43:20,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-18 22:43:20,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {1052#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1052#true} is VALID [2018-11-18 22:43:20,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {1052#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1052#true} is VALID [2018-11-18 22:43:20,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-18 22:43:20,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {1052#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1052#true} is VALID [2018-11-18 22:43:20,160 INFO L273 TraceCheckUtils]: 14: Hoare triple {1052#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1052#true} is VALID [2018-11-18 22:43:20,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {1052#true} assume true; {1052#true} is VALID [2018-11-18 22:43:20,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {1052#true} assume !(~a~0 < 100000); {1052#true} is VALID [2018-11-18 22:43:20,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {1052#true} havoc ~i~0;~i~0 := 0; {1112#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {1112#(<= main_~i~0 0)} assume true; {1112#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {1112#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1112#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:20,200 INFO L273 TraceCheckUtils]: 20: Hoare triple {1112#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1122#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:20,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {1122#(<= main_~i~0 1)} assume true; {1122#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:20,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {1122#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1122#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:20,214 INFO L273 TraceCheckUtils]: 23: Hoare triple {1122#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1132#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:20,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {1132#(<= main_~i~0 2)} assume true; {1132#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:20,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {1132#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1053#false} is VALID [2018-11-18 22:43:20,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {1053#false} havoc ~x~0;~x~0 := 0; {1053#false} is VALID [2018-11-18 22:43:20,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {1053#false} assume true; {1053#false} is VALID [2018-11-18 22:43:20,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {1053#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1053#false} is VALID [2018-11-18 22:43:20,216 INFO L256 TraceCheckUtils]: 29: Hoare triple {1053#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1053#false} is VALID [2018-11-18 22:43:20,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {1053#false} ~cond := #in~cond; {1053#false} is VALID [2018-11-18 22:43:20,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {1053#false} assume 0 == ~cond; {1053#false} is VALID [2018-11-18 22:43:20,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2018-11-18 22:43:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:43:20,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:20,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-18 22:43:20,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:43:20,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:20,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:43:20,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:20,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:43:20,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:43:20,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:20,287 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2018-11-18 22:43:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,518 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-18 22:43:20,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:43:20,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 22:43:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-18 22:43:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:43:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-18 22:43:20,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2018-11-18 22:43:20,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:20,646 INFO L225 Difference]: With dead ends: 67 [2018-11-18 22:43:20,646 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 22:43:20,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:43:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 22:43:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-18 22:43:20,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:20,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-18 22:43:20,673 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-18 22:43:20,673 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-18 22:43:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,676 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-18 22:43:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-18 22:43:20,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,677 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-18 22:43:20,677 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-18 22:43:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:20,679 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-18 22:43:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-18 22:43:20,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:20,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:20,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:20,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:43:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-18 22:43:20,683 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 33 [2018-11-18 22:43:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:20,683 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-18 22:43:20,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:43:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-18 22:43:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 22:43:20,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:20,685 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:20,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:20,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:20,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1802420716, now seen corresponding path program 4 times [2018-11-18 22:43:20,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:20,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {1400#true} call ULTIMATE.init(); {1400#true} is VALID [2018-11-18 22:43:20,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {1400#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1400#true} is VALID [2018-11-18 22:43:20,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {1400#true} assume true; {1400#true} is VALID [2018-11-18 22:43:20,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1400#true} {1400#true} #66#return; {1400#true} is VALID [2018-11-18 22:43:20,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {1400#true} call #t~ret8 := main(); {1400#true} is VALID [2018-11-18 22:43:20,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {1400#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1402#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {1402#(= main_~a~0 0)} assume true; {1402#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {1402#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1402#(= main_~a~0 0)} is VALID [2018-11-18 22:43:20,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {1402#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1403#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {1403#(<= main_~a~0 1)} assume true; {1403#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {1403#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1403#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:20,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {1403#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1404#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {1404#(<= main_~a~0 2)} assume true; {1404#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {1404#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1404#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:20,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {1404#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1405#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:20,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {1405#(<= main_~a~0 3)} assume true; {1405#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:20,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {1405#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1405#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:20,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {1405#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1406#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:20,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {1406#(<= main_~a~0 4)} assume true; {1406#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:20,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {1406#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1401#false} is VALID [2018-11-18 22:43:20,866 INFO L273 TraceCheckUtils]: 20: Hoare triple {1401#false} havoc ~i~0;~i~0 := 0; {1401#false} is VALID [2018-11-18 22:43:20,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:20,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {1401#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1401#false} is VALID [2018-11-18 22:43:20,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {1401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1401#false} is VALID [2018-11-18 22:43:20,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:20,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {1401#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1401#false} is VALID [2018-11-18 22:43:20,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {1401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1401#false} is VALID [2018-11-18 22:43:20,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:20,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {1401#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1401#false} is VALID [2018-11-18 22:43:20,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {1401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1401#false} is VALID [2018-11-18 22:43:20,869 INFO L273 TraceCheckUtils]: 30: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:20,870 INFO L273 TraceCheckUtils]: 31: Hoare triple {1401#false} assume !(~i~0 < 100000); {1401#false} is VALID [2018-11-18 22:43:20,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {1401#false} havoc ~x~0;~x~0 := 0; {1401#false} is VALID [2018-11-18 22:43:20,870 INFO L273 TraceCheckUtils]: 33: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:20,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {1401#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1401#false} is VALID [2018-11-18 22:43:20,871 INFO L256 TraceCheckUtils]: 35: Hoare triple {1401#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1401#false} is VALID [2018-11-18 22:43:20,871 INFO L273 TraceCheckUtils]: 36: Hoare triple {1401#false} ~cond := #in~cond; {1401#false} is VALID [2018-11-18 22:43:20,872 INFO L273 TraceCheckUtils]: 37: Hoare triple {1401#false} assume 0 == ~cond; {1401#false} is VALID [2018-11-18 22:43:20,872 INFO L273 TraceCheckUtils]: 38: Hoare triple {1401#false} assume !false; {1401#false} is VALID [2018-11-18 22:43:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:43:20,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:20,875 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-18 22:43:20,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:20,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:20,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:20,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:21,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {1400#true} call ULTIMATE.init(); {1400#true} is VALID [2018-11-18 22:43:21,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {1400#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1400#true} is VALID [2018-11-18 22:43:21,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {1400#true} assume true; {1400#true} is VALID [2018-11-18 22:43:21,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1400#true} {1400#true} #66#return; {1400#true} is VALID [2018-11-18 22:43:21,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {1400#true} call #t~ret8 := main(); {1400#true} is VALID [2018-11-18 22:43:21,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {1400#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1425#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:21,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {1425#(<= main_~a~0 0)} assume true; {1425#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:21,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {1425#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1425#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:21,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {1425#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1403#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {1403#(<= main_~a~0 1)} assume true; {1403#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {1403#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1403#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:21,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {1403#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1404#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {1404#(<= main_~a~0 2)} assume true; {1404#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {1404#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1404#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:21,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {1404#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1405#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {1405#(<= main_~a~0 3)} assume true; {1405#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {1405#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1405#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:21,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {1405#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1406#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:21,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {1406#(<= main_~a~0 4)} assume true; {1406#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:21,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {1406#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1401#false} is VALID [2018-11-18 22:43:21,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {1401#false} havoc ~i~0;~i~0 := 0; {1401#false} is VALID [2018-11-18 22:43:21,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:21,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {1401#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1401#false} is VALID [2018-11-18 22:43:21,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {1401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1401#false} is VALID [2018-11-18 22:43:21,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:21,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {1401#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1401#false} is VALID [2018-11-18 22:43:21,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {1401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1401#false} is VALID [2018-11-18 22:43:21,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:21,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {1401#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1401#false} is VALID [2018-11-18 22:43:21,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {1401#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1401#false} is VALID [2018-11-18 22:43:21,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:21,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {1401#false} assume !(~i~0 < 100000); {1401#false} is VALID [2018-11-18 22:43:21,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {1401#false} havoc ~x~0;~x~0 := 0; {1401#false} is VALID [2018-11-18 22:43:21,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {1401#false} assume true; {1401#false} is VALID [2018-11-18 22:43:21,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {1401#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1401#false} is VALID [2018-11-18 22:43:21,273 INFO L256 TraceCheckUtils]: 35: Hoare triple {1401#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1401#false} is VALID [2018-11-18 22:43:21,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {1401#false} ~cond := #in~cond; {1401#false} is VALID [2018-11-18 22:43:21,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {1401#false} assume 0 == ~cond; {1401#false} is VALID [2018-11-18 22:43:21,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {1401#false} assume !false; {1401#false} is VALID [2018-11-18 22:43:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:43:21,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:21,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:43:21,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-18 22:43:21,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:21,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:43:21,362 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-18 22:43:21,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:43:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:43:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:21,364 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 8 states. [2018-11-18 22:43:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,693 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-18 22:43:21,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:43:21,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-18 22:43:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-11-18 22:43:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:43:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-11-18 22:43:21,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2018-11-18 22:43:21,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:21,786 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:43:21,786 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 22:43:21,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:43:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 22:43:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-18 22:43:21,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:21,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-18 22:43:21,805 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-18 22:43:21,805 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-18 22:43:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,807 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-18 22:43:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-18 22:43:21,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:21,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:21,808 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-18 22:43:21,808 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-18 22:43:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:21,810 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-18 22:43:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-18 22:43:21,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:21,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:21,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:21,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:43:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-18 22:43:21,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2018-11-18 22:43:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:21,814 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-18 22:43:21,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:43:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 22:43:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:43:21,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:21,815 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:21,816 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:21,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash 889986471, now seen corresponding path program 5 times [2018-11-18 22:43:21,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:21,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:21,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:21,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-18 22:43:22,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-18 22:43:22,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #66#return; {1780#true} is VALID [2018-11-18 22:43:22,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret8 := main(); {1780#true} is VALID [2018-11-18 22:43:22,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1782#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {1782#(= main_~a~0 0)} assume true; {1782#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {1782#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1782#(= main_~a~0 0)} is VALID [2018-11-18 22:43:22,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {1782#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1783#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#(<= main_~a~0 1)} assume true; {1783#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {1783#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1783#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:22,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1784#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {1784#(<= main_~a~0 2)} assume true; {1784#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {1784#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1784#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:22,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {1784#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1785#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {1785#(<= main_~a~0 3)} assume true; {1785#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {1785#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1785#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:22,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {1785#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1786#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:22,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {1786#(<= main_~a~0 4)} assume true; {1786#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:22,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {1786#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1786#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:22,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {1786#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1787#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:22,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {1787#(<= main_~a~0 5)} assume true; {1787#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:22,037 INFO L273 TraceCheckUtils]: 22: Hoare triple {1787#(<= main_~a~0 5)} assume !(~a~0 < 100000); {1781#false} is VALID [2018-11-18 22:43:22,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {1781#false} havoc ~i~0;~i~0 := 0; {1781#false} is VALID [2018-11-18 22:43:22,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {1781#false} assume true; {1781#false} is VALID [2018-11-18 22:43:22,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {1781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1781#false} is VALID [2018-11-18 22:43:22,038 INFO L273 TraceCheckUtils]: 26: Hoare triple {1781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1781#false} is VALID [2018-11-18 22:43:22,038 INFO L273 TraceCheckUtils]: 27: Hoare triple {1781#false} assume true; {1781#false} is VALID [2018-11-18 22:43:22,038 INFO L273 TraceCheckUtils]: 28: Hoare triple {1781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1781#false} is VALID [2018-11-18 22:43:22,038 INFO L273 TraceCheckUtils]: 29: Hoare triple {1781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1781#false} is VALID [2018-11-18 22:43:22,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {1781#false} assume true; {1781#false} is VALID [2018-11-18 22:43:22,038 INFO L273 TraceCheckUtils]: 31: Hoare triple {1781#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1781#false} is VALID [2018-11-18 22:43:22,039 INFO L273 TraceCheckUtils]: 32: Hoare triple {1781#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1781#false} is VALID [2018-11-18 22:43:22,039 INFO L273 TraceCheckUtils]: 33: Hoare triple {1781#false} assume true; {1781#false} is VALID [2018-11-18 22:43:22,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {1781#false} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-18 22:43:22,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-18 22:43:22,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {1781#false} assume true; {1781#false} is VALID [2018-11-18 22:43:22,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {1781#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-18 22:43:22,040 INFO L256 TraceCheckUtils]: 38: Hoare triple {1781#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1781#false} is VALID [2018-11-18 22:43:22,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-18 22:43:22,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-18 22:43:22,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-18 22:43:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 22:43:22,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:22,042 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-18 22:43:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:43:22,180 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:43:22,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:22,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:22,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2018-11-18 22:43:22,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {1780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1780#true} is VALID [2018-11-18 22:43:22,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #66#return; {1780#true} is VALID [2018-11-18 22:43:22,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret8 := main(); {1780#true} is VALID [2018-11-18 22:43:22,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {1780#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1780#true} is VALID [2018-11-18 22:43:22,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {1780#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1780#true} is VALID [2018-11-18 22:43:22,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {1780#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1780#true} is VALID [2018-11-18 22:43:22,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {1780#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1780#true} is VALID [2018-11-18 22:43:22,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {1780#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1780#true} is VALID [2018-11-18 22:43:22,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {1780#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1780#true} is VALID [2018-11-18 22:43:22,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {1780#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1780#true} is VALID [2018-11-18 22:43:22,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {1780#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1780#true} is VALID [2018-11-18 22:43:22,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {1780#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1780#true} is VALID [2018-11-18 22:43:22,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {1780#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1780#true} is VALID [2018-11-18 22:43:22,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {1780#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1780#true} is VALID [2018-11-18 22:43:22,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {1780#true} assume true; {1780#true} is VALID [2018-11-18 22:43:22,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {1780#true} assume !(~a~0 < 100000); {1780#true} is VALID [2018-11-18 22:43:22,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {1780#true} havoc ~i~0;~i~0 := 0; {1860#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {1860#(<= main_~i~0 0)} assume true; {1860#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {1860#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1860#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:22,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {1860#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1870#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:22,358 INFO L273 TraceCheckUtils]: 27: Hoare triple {1870#(<= main_~i~0 1)} assume true; {1870#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:22,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {1870#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1870#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:22,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {1870#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1880#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:22,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {1880#(<= main_~i~0 2)} assume true; {1880#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:22,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {1880#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1880#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:22,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {1880#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1890#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:22,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {1890#(<= main_~i~0 3)} assume true; {1890#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:22,362 INFO L273 TraceCheckUtils]: 34: Hoare triple {1890#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1781#false} is VALID [2018-11-18 22:43:22,363 INFO L273 TraceCheckUtils]: 35: Hoare triple {1781#false} havoc ~x~0;~x~0 := 0; {1781#false} is VALID [2018-11-18 22:43:22,363 INFO L273 TraceCheckUtils]: 36: Hoare triple {1781#false} assume true; {1781#false} is VALID [2018-11-18 22:43:22,363 INFO L273 TraceCheckUtils]: 37: Hoare triple {1781#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1781#false} is VALID [2018-11-18 22:43:22,364 INFO L256 TraceCheckUtils]: 38: Hoare triple {1781#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1781#false} is VALID [2018-11-18 22:43:22,364 INFO L273 TraceCheckUtils]: 39: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2018-11-18 22:43:22,364 INFO L273 TraceCheckUtils]: 40: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2018-11-18 22:43:22,365 INFO L273 TraceCheckUtils]: 41: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2018-11-18 22:43:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 22:43:22,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:22,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-18 22:43:22,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-18 22:43:22,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:22,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:43:22,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:22,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:43:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:43:22,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:22,463 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 12 states. [2018-11-18 22:43:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:22,870 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-11-18 22:43:22,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:43:22,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-18 22:43:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-18 22:43:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-18 22:43:22,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2018-11-18 22:43:22,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:22,997 INFO L225 Difference]: With dead ends: 79 [2018-11-18 22:43:22,997 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 22:43:22,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 22:43:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-18 22:43:23,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:23,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-18 22:43:23,031 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-18 22:43:23,031 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-18 22:43:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:23,034 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-18 22:43:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:43:23,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:23,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:23,035 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-18 22:43:23,035 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-18 22:43:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:23,037 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-18 22:43:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-18 22:43:23,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:23,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:23,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:23,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:43:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-18 22:43:23,040 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2018-11-18 22:43:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:23,041 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-18 22:43:23,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:43:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-18 22:43:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 22:43:23,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:23,042 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:23,042 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:23,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1445473878, now seen corresponding path program 6 times [2018-11-18 22:43:23,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:23,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:23,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:23,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {2204#true} call ULTIMATE.init(); {2204#true} is VALID [2018-11-18 22:43:23,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {2204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2204#true} is VALID [2018-11-18 22:43:23,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {2204#true} assume true; {2204#true} is VALID [2018-11-18 22:43:23,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2204#true} {2204#true} #66#return; {2204#true} is VALID [2018-11-18 22:43:23,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {2204#true} call #t~ret8 := main(); {2204#true} is VALID [2018-11-18 22:43:23,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {2204#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2206#(= main_~a~0 0)} is VALID [2018-11-18 22:43:23,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#(= main_~a~0 0)} assume true; {2206#(= main_~a~0 0)} is VALID [2018-11-18 22:43:23,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2206#(= main_~a~0 0)} is VALID [2018-11-18 22:43:23,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2207#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {2207#(<= main_~a~0 1)} assume true; {2207#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {2207#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2207#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {2207#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2208#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {2208#(<= main_~a~0 2)} assume true; {2208#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {2208#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2208#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {2208#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2209#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {2209#(<= main_~a~0 3)} assume true; {2209#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {2209#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2209#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {2209#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2210#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {2210#(<= main_~a~0 4)} assume true; {2210#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {2210#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2210#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {2210#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2211#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {2211#(<= main_~a~0 5)} assume true; {2211#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {2211#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2211#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {2211#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2212#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:23,280 INFO L273 TraceCheckUtils]: 24: Hoare triple {2212#(<= main_~a~0 6)} assume true; {2212#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:23,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {2212#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2205#false} is VALID [2018-11-18 22:43:23,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {2205#false} havoc ~i~0;~i~0 := 0; {2205#false} is VALID [2018-11-18 22:43:23,281 INFO L273 TraceCheckUtils]: 27: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,282 INFO L273 TraceCheckUtils]: 32: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,282 INFO L273 TraceCheckUtils]: 33: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,283 INFO L273 TraceCheckUtils]: 35: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,283 INFO L273 TraceCheckUtils]: 36: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,283 INFO L273 TraceCheckUtils]: 38: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,283 INFO L273 TraceCheckUtils]: 39: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,283 INFO L273 TraceCheckUtils]: 40: Hoare triple {2205#false} assume !(~i~0 < 100000); {2205#false} is VALID [2018-11-18 22:43:23,283 INFO L273 TraceCheckUtils]: 41: Hoare triple {2205#false} havoc ~x~0;~x~0 := 0; {2205#false} is VALID [2018-11-18 22:43:23,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {2205#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2205#false} is VALID [2018-11-18 22:43:23,284 INFO L256 TraceCheckUtils]: 44: Hoare triple {2205#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2205#false} is VALID [2018-11-18 22:43:23,284 INFO L273 TraceCheckUtils]: 45: Hoare triple {2205#false} ~cond := #in~cond; {2205#false} is VALID [2018-11-18 22:43:23,284 INFO L273 TraceCheckUtils]: 46: Hoare triple {2205#false} assume 0 == ~cond; {2205#false} is VALID [2018-11-18 22:43:23,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {2205#false} assume !false; {2205#false} is VALID [2018-11-18 22:43:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 22:43:23,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:23,289 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-18 22:43:23,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:43:23,353 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:43:23,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:23,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:23,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {2204#true} call ULTIMATE.init(); {2204#true} is VALID [2018-11-18 22:43:23,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {2204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2204#true} is VALID [2018-11-18 22:43:23,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {2204#true} assume true; {2204#true} is VALID [2018-11-18 22:43:23,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2204#true} {2204#true} #66#return; {2204#true} is VALID [2018-11-18 22:43:23,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {2204#true} call #t~ret8 := main(); {2204#true} is VALID [2018-11-18 22:43:23,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {2204#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2231#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:23,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {2231#(<= main_~a~0 0)} assume true; {2231#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:23,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {2231#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2231#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:23,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {2231#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2207#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {2207#(<= main_~a~0 1)} assume true; {2207#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {2207#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2207#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:23,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {2207#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2208#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {2208#(<= main_~a~0 2)} assume true; {2208#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {2208#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2208#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:23,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {2208#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2209#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {2209#(<= main_~a~0 3)} assume true; {2209#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {2209#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2209#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:23,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {2209#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2210#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {2210#(<= main_~a~0 4)} assume true; {2210#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {2210#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2210#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:23,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {2210#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2211#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {2211#(<= main_~a~0 5)} assume true; {2211#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {2211#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2211#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:23,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {2211#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2212#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:23,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {2212#(<= main_~a~0 6)} assume true; {2212#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:23,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {2212#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2205#false} is VALID [2018-11-18 22:43:23,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {2205#false} havoc ~i~0;~i~0 := 0; {2205#false} is VALID [2018-11-18 22:43:23,565 INFO L273 TraceCheckUtils]: 27: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,565 INFO L273 TraceCheckUtils]: 29: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,566 INFO L273 TraceCheckUtils]: 30: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,566 INFO L273 TraceCheckUtils]: 31: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,567 INFO L273 TraceCheckUtils]: 34: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,567 INFO L273 TraceCheckUtils]: 35: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {2205#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2205#false} is VALID [2018-11-18 22:43:23,568 INFO L273 TraceCheckUtils]: 38: Hoare triple {2205#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2205#false} is VALID [2018-11-18 22:43:23,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,568 INFO L273 TraceCheckUtils]: 40: Hoare triple {2205#false} assume !(~i~0 < 100000); {2205#false} is VALID [2018-11-18 22:43:23,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {2205#false} havoc ~x~0;~x~0 := 0; {2205#false} is VALID [2018-11-18 22:43:23,569 INFO L273 TraceCheckUtils]: 42: Hoare triple {2205#false} assume true; {2205#false} is VALID [2018-11-18 22:43:23,569 INFO L273 TraceCheckUtils]: 43: Hoare triple {2205#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2205#false} is VALID [2018-11-18 22:43:23,569 INFO L256 TraceCheckUtils]: 44: Hoare triple {2205#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2205#false} is VALID [2018-11-18 22:43:23,569 INFO L273 TraceCheckUtils]: 45: Hoare triple {2205#false} ~cond := #in~cond; {2205#false} is VALID [2018-11-18 22:43:23,569 INFO L273 TraceCheckUtils]: 46: Hoare triple {2205#false} assume 0 == ~cond; {2205#false} is VALID [2018-11-18 22:43:23,570 INFO L273 TraceCheckUtils]: 47: Hoare triple {2205#false} assume !false; {2205#false} is VALID [2018-11-18 22:43:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 22:43:23,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:23,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:43:23,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-18 22:43:23,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:23,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:43:23,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:23,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:43:23,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:43:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:43:23,632 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 10 states. [2018-11-18 22:43:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:23,942 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-18 22:43:23,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:43:23,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-18 22:43:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:43:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-18 22:43:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:43:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-18 22:43:23,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2018-11-18 22:43:24,014 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-18 22:43:24,016 INFO L225 Difference]: With dead ends: 84 [2018-11-18 22:43:24,016 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 22:43:24,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-18 22:43:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 22:43:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-18 22:43:24,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:24,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-18 22:43:24,038 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-18 22:43:24,038 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-18 22:43:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:24,040 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-18 22:43:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-18 22:43:24,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:24,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:24,041 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-18 22:43:24,041 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-18 22:43:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:24,043 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-18 22:43:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-18 22:43:24,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:24,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:24,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:24,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 22:43:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-18 22:43:24,045 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 48 [2018-11-18 22:43:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:24,046 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-18 22:43:24,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:43:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-18 22:43:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:43:24,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:24,047 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:24,047 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:24,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:24,047 INFO L82 PathProgramCache]: Analyzing trace with hash -306808753, now seen corresponding path program 7 times [2018-11-18 22:43:24,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:24,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:24,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:24,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:24,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:24,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {2659#true} call ULTIMATE.init(); {2659#true} is VALID [2018-11-18 22:43:24,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {2659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2659#true} is VALID [2018-11-18 22:43:24,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {2659#true} assume true; {2659#true} is VALID [2018-11-18 22:43:24,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2659#true} {2659#true} #66#return; {2659#true} is VALID [2018-11-18 22:43:24,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {2659#true} call #t~ret8 := main(); {2659#true} is VALID [2018-11-18 22:43:24,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {2659#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2661#(= main_~a~0 0)} is VALID [2018-11-18 22:43:24,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {2661#(= main_~a~0 0)} assume true; {2661#(= main_~a~0 0)} is VALID [2018-11-18 22:43:24,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {2661#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2661#(= main_~a~0 0)} is VALID [2018-11-18 22:43:24,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {2661#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2662#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {2662#(<= main_~a~0 1)} assume true; {2662#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {2662#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2662#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {2662#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2663#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {2663#(<= main_~a~0 2)} assume true; {2663#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {2663#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2663#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {2663#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2664#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {2664#(<= main_~a~0 3)} assume true; {2664#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {2664#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2664#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {2664#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2665#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {2665#(<= main_~a~0 4)} assume true; {2665#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {2665#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2665#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {2665#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2666#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:24,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {2666#(<= main_~a~0 5)} assume true; {2666#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:24,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {2666#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2666#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:24,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {2666#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2667#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:24,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {2667#(<= main_~a~0 6)} assume true; {2667#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:24,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {2667#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2667#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:24,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {2667#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2668#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:24,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {2668#(<= main_~a~0 7)} assume true; {2668#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:24,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {2668#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2660#false} is VALID [2018-11-18 22:43:24,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {2660#false} havoc ~i~0;~i~0 := 0; {2660#false} is VALID [2018-11-18 22:43:24,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,779 INFO L273 TraceCheckUtils]: 34: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,780 INFO L273 TraceCheckUtils]: 37: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,780 INFO L273 TraceCheckUtils]: 38: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,781 INFO L273 TraceCheckUtils]: 39: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,781 INFO L273 TraceCheckUtils]: 40: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,781 INFO L273 TraceCheckUtils]: 41: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,781 INFO L273 TraceCheckUtils]: 42: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,781 INFO L273 TraceCheckUtils]: 43: Hoare triple {2660#false} assume !(~i~0 < 100000); {2660#false} is VALID [2018-11-18 22:43:24,782 INFO L273 TraceCheckUtils]: 44: Hoare triple {2660#false} havoc ~x~0;~x~0 := 0; {2660#false} is VALID [2018-11-18 22:43:24,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {2660#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2660#false} is VALID [2018-11-18 22:43:24,782 INFO L256 TraceCheckUtils]: 47: Hoare triple {2660#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2660#false} is VALID [2018-11-18 22:43:24,782 INFO L273 TraceCheckUtils]: 48: Hoare triple {2660#false} ~cond := #in~cond; {2660#false} is VALID [2018-11-18 22:43:24,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {2660#false} assume 0 == ~cond; {2660#false} is VALID [2018-11-18 22:43:24,783 INFO L273 TraceCheckUtils]: 50: Hoare triple {2660#false} assume !false; {2660#false} is VALID [2018-11-18 22:43:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 22:43:24,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:24,785 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-18 22:43:24,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:24,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:24,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {2659#true} call ULTIMATE.init(); {2659#true} is VALID [2018-11-18 22:43:24,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {2659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2659#true} is VALID [2018-11-18 22:43:24,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {2659#true} assume true; {2659#true} is VALID [2018-11-18 22:43:24,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2659#true} {2659#true} #66#return; {2659#true} is VALID [2018-11-18 22:43:24,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {2659#true} call #t~ret8 := main(); {2659#true} is VALID [2018-11-18 22:43:24,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {2659#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2687#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:24,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {2687#(<= main_~a~0 0)} assume true; {2687#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:24,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {2687#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2687#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:24,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {2687#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2662#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {2662#(<= main_~a~0 1)} assume true; {2662#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {2662#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2662#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:24,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {2662#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2663#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {2663#(<= main_~a~0 2)} assume true; {2663#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {2663#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2663#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:24,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {2663#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2664#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {2664#(<= main_~a~0 3)} assume true; {2664#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {2664#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2664#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:24,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {2664#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2665#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {2665#(<= main_~a~0 4)} assume true; {2665#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {2665#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2665#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:24,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {2665#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2666#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:24,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {2666#(<= main_~a~0 5)} assume true; {2666#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:24,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {2666#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2666#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:24,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {2666#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2667#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:24,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {2667#(<= main_~a~0 6)} assume true; {2667#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:24,971 INFO L273 TraceCheckUtils]: 25: Hoare triple {2667#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2667#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:24,972 INFO L273 TraceCheckUtils]: 26: Hoare triple {2667#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2668#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:24,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {2668#(<= main_~a~0 7)} assume true; {2668#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:24,973 INFO L273 TraceCheckUtils]: 28: Hoare triple {2668#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2660#false} is VALID [2018-11-18 22:43:24,973 INFO L273 TraceCheckUtils]: 29: Hoare triple {2660#false} havoc ~i~0;~i~0 := 0; {2660#false} is VALID [2018-11-18 22:43:24,973 INFO L273 TraceCheckUtils]: 30: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,974 INFO L273 TraceCheckUtils]: 31: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,974 INFO L273 TraceCheckUtils]: 34: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,975 INFO L273 TraceCheckUtils]: 38: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {2660#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2660#false} is VALID [2018-11-18 22:43:24,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {2660#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2660#false} is VALID [2018-11-18 22:43:24,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {2660#false} assume !(~i~0 < 100000); {2660#false} is VALID [2018-11-18 22:43:24,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {2660#false} havoc ~x~0;~x~0 := 0; {2660#false} is VALID [2018-11-18 22:43:24,976 INFO L273 TraceCheckUtils]: 45: Hoare triple {2660#false} assume true; {2660#false} is VALID [2018-11-18 22:43:24,976 INFO L273 TraceCheckUtils]: 46: Hoare triple {2660#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2660#false} is VALID [2018-11-18 22:43:24,977 INFO L256 TraceCheckUtils]: 47: Hoare triple {2660#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2660#false} is VALID [2018-11-18 22:43:24,977 INFO L273 TraceCheckUtils]: 48: Hoare triple {2660#false} ~cond := #in~cond; {2660#false} is VALID [2018-11-18 22:43:24,977 INFO L273 TraceCheckUtils]: 49: Hoare triple {2660#false} assume 0 == ~cond; {2660#false} is VALID [2018-11-18 22:43:24,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {2660#false} assume !false; {2660#false} is VALID [2018-11-18 22:43:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 22:43:24,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:24,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:43:24,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-18 22:43:24,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:24,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:43:25,040 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-18 22:43:25,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:43:25,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:43:25,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:43:25,041 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2018-11-18 22:43:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,581 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-18 22:43:25,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:43:25,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-18 22:43:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-18 22:43:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:43:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-18 22:43:25,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2018-11-18 22:43:25,679 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-18 22:43:25,681 INFO L225 Difference]: With dead ends: 87 [2018-11-18 22:43:25,681 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 22:43:25,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:43:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 22:43:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-18 22:43:25,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:25,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-18 22:43:25,702 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-18 22:43:25,702 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-18 22:43:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,704 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-18 22:43:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-18 22:43:25,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:25,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:25,705 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-18 22:43:25,705 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-18 22:43:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:25,706 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-18 22:43:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-18 22:43:25,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:25,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:25,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:25,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:43:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-18 22:43:25,708 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 51 [2018-11-18 22:43:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:25,708 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-18 22:43:25,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:43:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 22:43:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 22:43:25,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:25,709 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:25,710 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:25,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash 14226314, now seen corresponding path program 8 times [2018-11-18 22:43:25,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:25,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:26,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {3138#true} call ULTIMATE.init(); {3138#true} is VALID [2018-11-18 22:43:26,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {3138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3138#true} is VALID [2018-11-18 22:43:26,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {3138#true} assume true; {3138#true} is VALID [2018-11-18 22:43:26,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3138#true} {3138#true} #66#return; {3138#true} is VALID [2018-11-18 22:43:26,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {3138#true} call #t~ret8 := main(); {3138#true} is VALID [2018-11-18 22:43:26,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {3138#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3140#(= main_~a~0 0)} is VALID [2018-11-18 22:43:26,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {3140#(= main_~a~0 0)} assume true; {3140#(= main_~a~0 0)} is VALID [2018-11-18 22:43:26,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {3140#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3140#(= main_~a~0 0)} is VALID [2018-11-18 22:43:26,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {3140#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3141#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {3141#(<= main_~a~0 1)} assume true; {3141#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {3141#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3141#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {3141#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3142#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {3142#(<= main_~a~0 2)} assume true; {3142#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {3142#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3142#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {3142#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3143#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {3143#(<= main_~a~0 3)} assume true; {3143#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {3143#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3143#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {3143#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3144#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {3144#(<= main_~a~0 4)} assume true; {3144#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {3144#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3144#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {3144#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3145#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {3145#(<= main_~a~0 5)} assume true; {3145#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {3145#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3145#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {3145#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3146#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {3146#(<= main_~a~0 6)} assume true; {3146#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {3146#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3146#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {3146#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3147#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {3147#(<= main_~a~0 7)} assume true; {3147#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {3147#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3147#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {3147#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3148#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:26,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {3148#(<= main_~a~0 8)} assume true; {3148#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:26,023 INFO L273 TraceCheckUtils]: 31: Hoare triple {3148#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3139#false} is VALID [2018-11-18 22:43:26,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {3139#false} havoc ~i~0;~i~0 := 0; {3139#false} is VALID [2018-11-18 22:43:26,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,023 INFO L273 TraceCheckUtils]: 34: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,024 INFO L273 TraceCheckUtils]: 39: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,025 INFO L273 TraceCheckUtils]: 40: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {3139#false} assume !(~i~0 < 100000); {3139#false} is VALID [2018-11-18 22:43:26,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {3139#false} havoc ~x~0;~x~0 := 0; {3139#false} is VALID [2018-11-18 22:43:26,026 INFO L273 TraceCheckUtils]: 48: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,027 INFO L273 TraceCheckUtils]: 49: Hoare triple {3139#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3139#false} is VALID [2018-11-18 22:43:26,027 INFO L256 TraceCheckUtils]: 50: Hoare triple {3139#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3139#false} is VALID [2018-11-18 22:43:26,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {3139#false} ~cond := #in~cond; {3139#false} is VALID [2018-11-18 22:43:26,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {3139#false} assume 0 == ~cond; {3139#false} is VALID [2018-11-18 22:43:26,028 INFO L273 TraceCheckUtils]: 53: Hoare triple {3139#false} assume !false; {3139#false} is VALID [2018-11-18 22:43:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 22:43:26,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:26,030 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-18 22:43:26,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:26,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:26,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:26,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:26,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {3138#true} call ULTIMATE.init(); {3138#true} is VALID [2018-11-18 22:43:26,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {3138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3138#true} is VALID [2018-11-18 22:43:26,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {3138#true} assume true; {3138#true} is VALID [2018-11-18 22:43:26,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3138#true} {3138#true} #66#return; {3138#true} is VALID [2018-11-18 22:43:26,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {3138#true} call #t~ret8 := main(); {3138#true} is VALID [2018-11-18 22:43:26,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {3138#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3167#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:26,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {3167#(<= main_~a~0 0)} assume true; {3167#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:26,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {3167#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3167#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:26,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {3167#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3141#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {3141#(<= main_~a~0 1)} assume true; {3141#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {3141#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3141#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:26,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {3141#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3142#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {3142#(<= main_~a~0 2)} assume true; {3142#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {3142#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3142#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:26,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {3142#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3143#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {3143#(<= main_~a~0 3)} assume true; {3143#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {3143#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3143#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:26,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {3143#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3144#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {3144#(<= main_~a~0 4)} assume true; {3144#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {3144#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3144#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:26,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {3144#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3145#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {3145#(<= main_~a~0 5)} assume true; {3145#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {3145#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3145#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:26,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {3145#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3146#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {3146#(<= main_~a~0 6)} assume true; {3146#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,423 INFO L273 TraceCheckUtils]: 25: Hoare triple {3146#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3146#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:26,423 INFO L273 TraceCheckUtils]: 26: Hoare triple {3146#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3147#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {3147#(<= main_~a~0 7)} assume true; {3147#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {3147#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3147#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:26,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {3147#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3148#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:26,424 INFO L273 TraceCheckUtils]: 30: Hoare triple {3148#(<= main_~a~0 8)} assume true; {3148#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:26,425 INFO L273 TraceCheckUtils]: 31: Hoare triple {3148#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3139#false} is VALID [2018-11-18 22:43:26,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {3139#false} havoc ~i~0;~i~0 := 0; {3139#false} is VALID [2018-11-18 22:43:26,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,426 INFO L273 TraceCheckUtils]: 36: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,426 INFO L273 TraceCheckUtils]: 39: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,426 INFO L273 TraceCheckUtils]: 40: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,427 INFO L273 TraceCheckUtils]: 41: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,427 INFO L273 TraceCheckUtils]: 42: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,427 INFO L273 TraceCheckUtils]: 43: Hoare triple {3139#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3139#false} is VALID [2018-11-18 22:43:26,427 INFO L273 TraceCheckUtils]: 44: Hoare triple {3139#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3139#false} is VALID [2018-11-18 22:43:26,427 INFO L273 TraceCheckUtils]: 45: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L273 TraceCheckUtils]: 46: Hoare triple {3139#false} assume !(~i~0 < 100000); {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L273 TraceCheckUtils]: 47: Hoare triple {3139#false} havoc ~x~0;~x~0 := 0; {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L273 TraceCheckUtils]: 48: Hoare triple {3139#false} assume true; {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L273 TraceCheckUtils]: 49: Hoare triple {3139#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L256 TraceCheckUtils]: 50: Hoare triple {3139#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L273 TraceCheckUtils]: 51: Hoare triple {3139#false} ~cond := #in~cond; {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {3139#false} assume 0 == ~cond; {3139#false} is VALID [2018-11-18 22:43:26,428 INFO L273 TraceCheckUtils]: 53: Hoare triple {3139#false} assume !false; {3139#false} is VALID [2018-11-18 22:43:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 22:43:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:43:26,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-18 22:43:26,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:26,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:43:26,577 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-18 22:43:26,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:43:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:43:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:43:26,578 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 12 states. [2018-11-18 22:43:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:26,900 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-18 22:43:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:43:26,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-18 22:43:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-18 22:43:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:43:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2018-11-18 22:43:26,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2018-11-18 22:43:26,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:26,968 INFO L225 Difference]: With dead ends: 90 [2018-11-18 22:43:26,969 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 22:43:26,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 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-18 22:43:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 22:43:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-18 22:43:26,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:26,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-18 22:43:26,995 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-18 22:43:26,996 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-18 22:43:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:26,997 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 22:43:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:43:26,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:26,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:26,997 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-18 22:43:26,997 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-18 22:43:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:26,999 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 22:43:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 22:43:26,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:26,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:26,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:26,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 22:43:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-18 22:43:27,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 54 [2018-11-18 22:43:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:27,000 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-18 22:43:27,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:43:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-18 22:43:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 22:43:27,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:27,001 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:27,002 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:27,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash -922260881, now seen corresponding path program 9 times [2018-11-18 22:43:27,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:27,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:27,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:27,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {3641#true} call ULTIMATE.init(); {3641#true} is VALID [2018-11-18 22:43:27,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {3641#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3641#true} is VALID [2018-11-18 22:43:27,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3641#true} {3641#true} #66#return; {3641#true} is VALID [2018-11-18 22:43:27,240 INFO L256 TraceCheckUtils]: 4: Hoare triple {3641#true} call #t~ret8 := main(); {3641#true} is VALID [2018-11-18 22:43:27,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {3641#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3643#(= main_~a~0 0)} is VALID [2018-11-18 22:43:27,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {3643#(= main_~a~0 0)} assume true; {3643#(= main_~a~0 0)} is VALID [2018-11-18 22:43:27,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {3643#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3643#(= main_~a~0 0)} is VALID [2018-11-18 22:43:27,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {3643#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3644#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:27,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {3644#(<= main_~a~0 1)} assume true; {3644#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:27,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {3644#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3644#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:27,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {3644#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3645#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:27,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {3645#(<= main_~a~0 2)} assume true; {3645#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:27,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {3645#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3645#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:27,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {3645#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3646#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:27,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {3646#(<= main_~a~0 3)} assume true; {3646#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:27,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {3646#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3646#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:27,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {3646#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3647#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:27,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {3647#(<= main_~a~0 4)} assume true; {3647#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:27,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {3647#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3647#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:27,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {3647#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3648#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:27,302 INFO L273 TraceCheckUtils]: 21: Hoare triple {3648#(<= main_~a~0 5)} assume true; {3648#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:27,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {3648#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3648#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:27,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {3648#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3649#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:27,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {3649#(<= main_~a~0 6)} assume true; {3649#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:27,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {3649#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3649#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:27,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {3649#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3650#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:27,304 INFO L273 TraceCheckUtils]: 27: Hoare triple {3650#(<= main_~a~0 7)} assume true; {3650#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:27,304 INFO L273 TraceCheckUtils]: 28: Hoare triple {3650#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3650#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:27,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {3650#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3651#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:27,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {3651#(<= main_~a~0 8)} assume true; {3651#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:27,307 INFO L273 TraceCheckUtils]: 31: Hoare triple {3651#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3651#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:27,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {3651#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3652#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:27,308 INFO L273 TraceCheckUtils]: 33: Hoare triple {3652#(<= main_~a~0 9)} assume true; {3652#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:27,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {3652#(<= main_~a~0 9)} assume !(~a~0 < 100000); {3642#false} is VALID [2018-11-18 22:43:27,309 INFO L273 TraceCheckUtils]: 35: Hoare triple {3642#false} havoc ~i~0;~i~0 := 0; {3642#false} is VALID [2018-11-18 22:43:27,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {3642#false} assume true; {3642#false} is VALID [2018-11-18 22:43:27,309 INFO L273 TraceCheckUtils]: 37: Hoare triple {3642#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3642#false} is VALID [2018-11-18 22:43:27,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {3642#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3642#false} is VALID [2018-11-18 22:43:27,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {3642#false} assume true; {3642#false} is VALID [2018-11-18 22:43:27,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {3642#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3642#false} is VALID [2018-11-18 22:43:27,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {3642#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3642#false} is VALID [2018-11-18 22:43:27,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {3642#false} assume true; {3642#false} is VALID [2018-11-18 22:43:27,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {3642#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3642#false} is VALID [2018-11-18 22:43:27,310 INFO L273 TraceCheckUtils]: 44: Hoare triple {3642#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3642#false} is VALID [2018-11-18 22:43:27,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {3642#false} assume true; {3642#false} is VALID [2018-11-18 22:43:27,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {3642#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3642#false} is VALID [2018-11-18 22:43:27,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {3642#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3642#false} is VALID [2018-11-18 22:43:27,311 INFO L273 TraceCheckUtils]: 48: Hoare triple {3642#false} assume true; {3642#false} is VALID [2018-11-18 22:43:27,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {3642#false} assume !(~i~0 < 100000); {3642#false} is VALID [2018-11-18 22:43:27,311 INFO L273 TraceCheckUtils]: 50: Hoare triple {3642#false} havoc ~x~0;~x~0 := 0; {3642#false} is VALID [2018-11-18 22:43:27,311 INFO L273 TraceCheckUtils]: 51: Hoare triple {3642#false} assume true; {3642#false} is VALID [2018-11-18 22:43:27,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {3642#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3642#false} is VALID [2018-11-18 22:43:27,312 INFO L256 TraceCheckUtils]: 53: Hoare triple {3642#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3642#false} is VALID [2018-11-18 22:43:27,312 INFO L273 TraceCheckUtils]: 54: Hoare triple {3642#false} ~cond := #in~cond; {3642#false} is VALID [2018-11-18 22:43:27,312 INFO L273 TraceCheckUtils]: 55: Hoare triple {3642#false} assume 0 == ~cond; {3642#false} is VALID [2018-11-18 22:43:27,312 INFO L273 TraceCheckUtils]: 56: Hoare triple {3642#false} assume !false; {3642#false} is VALID [2018-11-18 22:43:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 22:43:27,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:27,319 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-18 22:43:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:27,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 22:43:27,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:27,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:27,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {3641#true} call ULTIMATE.init(); {3641#true} is VALID [2018-11-18 22:43:27,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {3641#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3641#true} is VALID [2018-11-18 22:43:27,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3641#true} {3641#true} #66#return; {3641#true} is VALID [2018-11-18 22:43:27,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {3641#true} call #t~ret8 := main(); {3641#true} is VALID [2018-11-18 22:43:27,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {3641#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3641#true} is VALID [2018-11-18 22:43:27,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 20: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,504 INFO L273 TraceCheckUtils]: 31: Hoare triple {3641#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3641#true} is VALID [2018-11-18 22:43:27,504 INFO L273 TraceCheckUtils]: 32: Hoare triple {3641#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3641#true} is VALID [2018-11-18 22:43:27,505 INFO L273 TraceCheckUtils]: 33: Hoare triple {3641#true} assume true; {3641#true} is VALID [2018-11-18 22:43:27,505 INFO L273 TraceCheckUtils]: 34: Hoare triple {3641#true} assume !(~a~0 < 100000); {3641#true} is VALID [2018-11-18 22:43:27,525 INFO L273 TraceCheckUtils]: 35: Hoare triple {3641#true} havoc ~i~0;~i~0 := 0; {3761#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:27,534 INFO L273 TraceCheckUtils]: 36: Hoare triple {3761#(<= main_~i~0 0)} assume true; {3761#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:27,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {3761#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3761#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:27,562 INFO L273 TraceCheckUtils]: 38: Hoare triple {3761#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3771#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:27,571 INFO L273 TraceCheckUtils]: 39: Hoare triple {3771#(<= main_~i~0 1)} assume true; {3771#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:27,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {3771#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3771#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:27,593 INFO L273 TraceCheckUtils]: 41: Hoare triple {3771#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3781#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:27,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {3781#(<= main_~i~0 2)} assume true; {3781#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:27,611 INFO L273 TraceCheckUtils]: 43: Hoare triple {3781#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3781#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:27,612 INFO L273 TraceCheckUtils]: 44: Hoare triple {3781#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3791#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:27,612 INFO L273 TraceCheckUtils]: 45: Hoare triple {3791#(<= main_~i~0 3)} assume true; {3791#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:27,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {3791#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3791#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:27,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {3791#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3801#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:27,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {3801#(<= main_~i~0 4)} assume true; {3801#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:27,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {3801#(<= main_~i~0 4)} assume !(~i~0 < 100000); {3642#false} is VALID [2018-11-18 22:43:27,618 INFO L273 TraceCheckUtils]: 50: Hoare triple {3642#false} havoc ~x~0;~x~0 := 0; {3642#false} is VALID [2018-11-18 22:43:27,618 INFO L273 TraceCheckUtils]: 51: Hoare triple {3642#false} assume true; {3642#false} is VALID [2018-11-18 22:43:27,618 INFO L273 TraceCheckUtils]: 52: Hoare triple {3642#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3642#false} is VALID [2018-11-18 22:43:27,619 INFO L256 TraceCheckUtils]: 53: Hoare triple {3642#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3642#false} is VALID [2018-11-18 22:43:27,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {3642#false} ~cond := #in~cond; {3642#false} is VALID [2018-11-18 22:43:27,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {3642#false} assume 0 == ~cond; {3642#false} is VALID [2018-11-18 22:43:27,619 INFO L273 TraceCheckUtils]: 56: Hoare triple {3642#false} assume !false; {3642#false} is VALID [2018-11-18 22:43:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:43:27,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:27,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-18 22:43:27,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-11-18 22:43:27,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:27,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:43:27,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:27,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:43:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:43:27,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:43:27,701 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2018-11-18 22:43:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:27,993 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-11-18 22:43:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:43:27,994 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-11-18 22:43:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:43:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2018-11-18 22:43:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:43:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2018-11-18 22:43:27,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 91 transitions. [2018-11-18 22:43:28,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:28,083 INFO L225 Difference]: With dead ends: 97 [2018-11-18 22:43:28,083 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 22:43:28,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:43:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 22:43:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-18 22:43:28,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:28,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2018-11-18 22:43:28,111 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2018-11-18 22:43:28,111 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2018-11-18 22:43:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:28,113 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-18 22:43:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-18 22:43:28,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:28,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:28,114 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2018-11-18 22:43:28,114 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2018-11-18 22:43:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:28,115 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-18 22:43:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-18 22:43:28,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:28,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:28,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:28,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 22:43:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-18 22:43:28,118 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 57 [2018-11-18 22:43:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:28,118 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-18 22:43:28,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:43:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-18 22:43:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 22:43:28,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:28,119 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:28,120 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:28,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:28,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1353555060, now seen corresponding path program 10 times [2018-11-18 22:43:28,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:28,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:28,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:28,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4189#true} is VALID [2018-11-18 22:43:28,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {4189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4189#true} is VALID [2018-11-18 22:43:28,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2018-11-18 22:43:28,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #66#return; {4189#true} is VALID [2018-11-18 22:43:28,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret8 := main(); {4189#true} is VALID [2018-11-18 22:43:28,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {4189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4191#(= main_~a~0 0)} is VALID [2018-11-18 22:43:28,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {4191#(= main_~a~0 0)} assume true; {4191#(= main_~a~0 0)} is VALID [2018-11-18 22:43:28,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {4191#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4191#(= main_~a~0 0)} is VALID [2018-11-18 22:43:28,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {4191#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {4192#(<= main_~a~0 1)} assume true; {4192#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {4192#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {4192#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4193#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {4193#(<= main_~a~0 2)} assume true; {4193#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {4193#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4193#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {4193#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4194#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {4194#(<= main_~a~0 3)} assume true; {4194#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {4194#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4194#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {4194#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4195#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {4195#(<= main_~a~0 4)} assume true; {4195#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {4195#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4195#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {4195#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4196#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {4196#(<= main_~a~0 5)} assume true; {4196#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {4196#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4196#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {4196#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4197#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,363 INFO L273 TraceCheckUtils]: 24: Hoare triple {4197#(<= main_~a~0 6)} assume true; {4197#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {4197#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4197#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,364 INFO L273 TraceCheckUtils]: 26: Hoare triple {4197#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4198#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {4198#(<= main_~a~0 7)} assume true; {4198#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {4198#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4198#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {4198#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4199#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {4199#(<= main_~a~0 8)} assume true; {4199#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {4199#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4199#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {4199#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4200#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:28,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {4200#(<= main_~a~0 9)} assume true; {4200#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:28,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {4200#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4200#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:28,369 INFO L273 TraceCheckUtils]: 35: Hoare triple {4200#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4201#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:28,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {4201#(<= main_~a~0 10)} assume true; {4201#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:28,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {4201#(<= main_~a~0 10)} assume !(~a~0 < 100000); {4190#false} is VALID [2018-11-18 22:43:28,371 INFO L273 TraceCheckUtils]: 38: Hoare triple {4190#false} havoc ~i~0;~i~0 := 0; {4190#false} is VALID [2018-11-18 22:43:28,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,371 INFO L273 TraceCheckUtils]: 41: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 48: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 50: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 52: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 53: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 54: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 55: Hoare triple {4190#false} assume !(~i~0 < 100000); {4190#false} is VALID [2018-11-18 22:43:28,373 INFO L273 TraceCheckUtils]: 56: Hoare triple {4190#false} havoc ~x~0;~x~0 := 0; {4190#false} is VALID [2018-11-18 22:43:28,374 INFO L273 TraceCheckUtils]: 57: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {4190#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4190#false} is VALID [2018-11-18 22:43:28,374 INFO L256 TraceCheckUtils]: 59: Hoare triple {4190#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4190#false} is VALID [2018-11-18 22:43:28,374 INFO L273 TraceCheckUtils]: 60: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2018-11-18 22:43:28,374 INFO L273 TraceCheckUtils]: 61: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2018-11-18 22:43:28,374 INFO L273 TraceCheckUtils]: 62: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2018-11-18 22:43:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 22:43:28,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:28,377 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-18 22:43:28,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:28,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:28,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:28,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:28,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4189#true} is VALID [2018-11-18 22:43:28,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {4189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4189#true} is VALID [2018-11-18 22:43:28,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2018-11-18 22:43:28,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #66#return; {4189#true} is VALID [2018-11-18 22:43:28,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret8 := main(); {4189#true} is VALID [2018-11-18 22:43:28,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {4189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4220#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:28,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {4220#(<= main_~a~0 0)} assume true; {4220#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:28,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {4220#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4220#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:28,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {4220#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {4192#(<= main_~a~0 1)} assume true; {4192#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {4192#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:28,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {4192#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4193#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {4193#(<= main_~a~0 2)} assume true; {4193#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {4193#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4193#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:28,697 INFO L273 TraceCheckUtils]: 14: Hoare triple {4193#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4194#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {4194#(<= main_~a~0 3)} assume true; {4194#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {4194#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4194#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:28,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {4194#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4195#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {4195#(<= main_~a~0 4)} assume true; {4195#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {4195#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4195#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:28,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {4195#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4196#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {4196#(<= main_~a~0 5)} assume true; {4196#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {4196#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4196#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:28,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {4196#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4197#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {4197#(<= main_~a~0 6)} assume true; {4197#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,703 INFO L273 TraceCheckUtils]: 25: Hoare triple {4197#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4197#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:28,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {4197#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4198#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {4198#(<= main_~a~0 7)} assume true; {4198#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,705 INFO L273 TraceCheckUtils]: 28: Hoare triple {4198#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4198#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:28,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {4198#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4199#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {4199#(<= main_~a~0 8)} assume true; {4199#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {4199#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4199#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:28,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {4199#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4200#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:28,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {4200#(<= main_~a~0 9)} assume true; {4200#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:28,709 INFO L273 TraceCheckUtils]: 34: Hoare triple {4200#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4200#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:28,709 INFO L273 TraceCheckUtils]: 35: Hoare triple {4200#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4201#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:28,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {4201#(<= main_~a~0 10)} assume true; {4201#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:28,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {4201#(<= main_~a~0 10)} assume !(~a~0 < 100000); {4190#false} is VALID [2018-11-18 22:43:28,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {4190#false} havoc ~i~0;~i~0 := 0; {4190#false} is VALID [2018-11-18 22:43:28,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,712 INFO L273 TraceCheckUtils]: 41: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,712 INFO L273 TraceCheckUtils]: 44: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,712 INFO L273 TraceCheckUtils]: 45: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,713 INFO L273 TraceCheckUtils]: 46: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,713 INFO L273 TraceCheckUtils]: 47: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,713 INFO L273 TraceCheckUtils]: 49: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,713 INFO L273 TraceCheckUtils]: 50: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,714 INFO L273 TraceCheckUtils]: 52: Hoare triple {4190#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4190#false} is VALID [2018-11-18 22:43:28,714 INFO L273 TraceCheckUtils]: 53: Hoare triple {4190#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4190#false} is VALID [2018-11-18 22:43:28,714 INFO L273 TraceCheckUtils]: 54: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,714 INFO L273 TraceCheckUtils]: 55: Hoare triple {4190#false} assume !(~i~0 < 100000); {4190#false} is VALID [2018-11-18 22:43:28,715 INFO L273 TraceCheckUtils]: 56: Hoare triple {4190#false} havoc ~x~0;~x~0 := 0; {4190#false} is VALID [2018-11-18 22:43:28,715 INFO L273 TraceCheckUtils]: 57: Hoare triple {4190#false} assume true; {4190#false} is VALID [2018-11-18 22:43:28,715 INFO L273 TraceCheckUtils]: 58: Hoare triple {4190#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4190#false} is VALID [2018-11-18 22:43:28,715 INFO L256 TraceCheckUtils]: 59: Hoare triple {4190#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4190#false} is VALID [2018-11-18 22:43:28,715 INFO L273 TraceCheckUtils]: 60: Hoare triple {4190#false} ~cond := #in~cond; {4190#false} is VALID [2018-11-18 22:43:28,715 INFO L273 TraceCheckUtils]: 61: Hoare triple {4190#false} assume 0 == ~cond; {4190#false} is VALID [2018-11-18 22:43:28,715 INFO L273 TraceCheckUtils]: 62: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2018-11-18 22:43:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 22:43:28,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:28,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:43:28,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-11-18 22:43:28,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:28,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:43:28,796 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-18 22:43:28,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:43:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:43:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:43:28,797 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 14 states. [2018-11-18 22:43:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:29,107 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-18 22:43:29,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:43:29,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-11-18 22:43:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:43:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-18 22:43:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:43:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-18 22:43:29,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-18 22:43:29,256 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-18 22:43:29,258 INFO L225 Difference]: With dead ends: 102 [2018-11-18 22:43:29,259 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 22:43:29,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 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-18 22:43:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 22:43:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-18 22:43:29,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:29,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-18 22:43:29,284 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-18 22:43:29,284 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-18 22:43:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:29,286 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-18 22:43:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-18 22:43:29,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:29,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:29,287 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-18 22:43:29,287 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-18 22:43:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:29,289 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-18 22:43:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-18 22:43:29,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:29,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:29,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:29,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 22:43:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-18 22:43:29,291 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 63 [2018-11-18 22:43:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:29,292 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-18 22:43:29,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:43:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 22:43:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 22:43:29,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:29,293 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:29,293 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:29,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1821834823, now seen corresponding path program 11 times [2018-11-18 22:43:29,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:29,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:29,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:29,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:29,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:29,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {4767#true} call ULTIMATE.init(); {4767#true} is VALID [2018-11-18 22:43:29,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {4767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4767#true} is VALID [2018-11-18 22:43:29,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {4767#true} assume true; {4767#true} is VALID [2018-11-18 22:43:29,606 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4767#true} {4767#true} #66#return; {4767#true} is VALID [2018-11-18 22:43:29,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {4767#true} call #t~ret8 := main(); {4767#true} is VALID [2018-11-18 22:43:29,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {4767#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4769#(= main_~a~0 0)} is VALID [2018-11-18 22:43:29,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {4769#(= main_~a~0 0)} assume true; {4769#(= main_~a~0 0)} is VALID [2018-11-18 22:43:29,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {4769#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4769#(= main_~a~0 0)} is VALID [2018-11-18 22:43:29,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {4769#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4770#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:29,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {4770#(<= main_~a~0 1)} assume true; {4770#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:29,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {4770#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4770#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:29,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {4770#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4771#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:29,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {4771#(<= main_~a~0 2)} assume true; {4771#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:29,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {4771#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4771#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:29,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {4771#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4772#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:29,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {4772#(<= main_~a~0 3)} assume true; {4772#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:29,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {4772#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4772#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:29,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {4772#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4773#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:29,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {4773#(<= main_~a~0 4)} assume true; {4773#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:29,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {4773#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4773#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:29,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {4773#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4774#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:29,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {4774#(<= main_~a~0 5)} assume true; {4774#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:29,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {4774#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4774#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:29,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {4774#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4775#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:29,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {4775#(<= main_~a~0 6)} assume true; {4775#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:29,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {4775#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4775#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:29,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {4775#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4776#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:29,621 INFO L273 TraceCheckUtils]: 27: Hoare triple {4776#(<= main_~a~0 7)} assume true; {4776#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:29,622 INFO L273 TraceCheckUtils]: 28: Hoare triple {4776#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4776#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:29,622 INFO L273 TraceCheckUtils]: 29: Hoare triple {4776#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4777#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:29,623 INFO L273 TraceCheckUtils]: 30: Hoare triple {4777#(<= main_~a~0 8)} assume true; {4777#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:29,624 INFO L273 TraceCheckUtils]: 31: Hoare triple {4777#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4777#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:29,624 INFO L273 TraceCheckUtils]: 32: Hoare triple {4777#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4778#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:29,625 INFO L273 TraceCheckUtils]: 33: Hoare triple {4778#(<= main_~a~0 9)} assume true; {4778#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:29,626 INFO L273 TraceCheckUtils]: 34: Hoare triple {4778#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4778#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:29,626 INFO L273 TraceCheckUtils]: 35: Hoare triple {4778#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4779#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:29,627 INFO L273 TraceCheckUtils]: 36: Hoare triple {4779#(<= main_~a~0 10)} assume true; {4779#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:29,628 INFO L273 TraceCheckUtils]: 37: Hoare triple {4779#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4779#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:29,628 INFO L273 TraceCheckUtils]: 38: Hoare triple {4779#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4780#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:29,629 INFO L273 TraceCheckUtils]: 39: Hoare triple {4780#(<= main_~a~0 11)} assume true; {4780#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:29,630 INFO L273 TraceCheckUtils]: 40: Hoare triple {4780#(<= main_~a~0 11)} assume !(~a~0 < 100000); {4768#false} is VALID [2018-11-18 22:43:29,630 INFO L273 TraceCheckUtils]: 41: Hoare triple {4768#false} havoc ~i~0;~i~0 := 0; {4768#false} is VALID [2018-11-18 22:43:29,630 INFO L273 TraceCheckUtils]: 42: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:29,630 INFO L273 TraceCheckUtils]: 43: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:29,631 INFO L273 TraceCheckUtils]: 44: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:29,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:29,631 INFO L273 TraceCheckUtils]: 46: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:29,631 INFO L273 TraceCheckUtils]: 47: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:29,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:29,632 INFO L273 TraceCheckUtils]: 49: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:29,632 INFO L273 TraceCheckUtils]: 50: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:29,632 INFO L273 TraceCheckUtils]: 51: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:29,633 INFO L273 TraceCheckUtils]: 52: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:29,633 INFO L273 TraceCheckUtils]: 53: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:29,633 INFO L273 TraceCheckUtils]: 54: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:29,633 INFO L273 TraceCheckUtils]: 55: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:29,634 INFO L273 TraceCheckUtils]: 56: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:29,634 INFO L273 TraceCheckUtils]: 57: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:29,634 INFO L273 TraceCheckUtils]: 58: Hoare triple {4768#false} assume !(~i~0 < 100000); {4768#false} is VALID [2018-11-18 22:43:29,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {4768#false} havoc ~x~0;~x~0 := 0; {4768#false} is VALID [2018-11-18 22:43:29,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:29,635 INFO L273 TraceCheckUtils]: 61: Hoare triple {4768#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4768#false} is VALID [2018-11-18 22:43:29,635 INFO L256 TraceCheckUtils]: 62: Hoare triple {4768#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4768#false} is VALID [2018-11-18 22:43:29,635 INFO L273 TraceCheckUtils]: 63: Hoare triple {4768#false} ~cond := #in~cond; {4768#false} is VALID [2018-11-18 22:43:29,635 INFO L273 TraceCheckUtils]: 64: Hoare triple {4768#false} assume 0 == ~cond; {4768#false} is VALID [2018-11-18 22:43:29,635 INFO L273 TraceCheckUtils]: 65: Hoare triple {4768#false} assume !false; {4768#false} is VALID [2018-11-18 22:43:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 22:43:29,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:29,640 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-18 22:43:29,650 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:43:30,062 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:43:30,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:30,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:30,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {4767#true} call ULTIMATE.init(); {4767#true} is VALID [2018-11-18 22:43:30,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {4767#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4767#true} is VALID [2018-11-18 22:43:30,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {4767#true} assume true; {4767#true} is VALID [2018-11-18 22:43:30,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4767#true} {4767#true} #66#return; {4767#true} is VALID [2018-11-18 22:43:30,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {4767#true} call #t~ret8 := main(); {4767#true} is VALID [2018-11-18 22:43:30,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {4767#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4799#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:30,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {4799#(<= main_~a~0 0)} assume true; {4799#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:30,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {4799#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4799#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:30,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {4799#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4770#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:30,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {4770#(<= main_~a~0 1)} assume true; {4770#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:30,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {4770#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4770#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:30,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {4770#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4771#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:30,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {4771#(<= main_~a~0 2)} assume true; {4771#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:30,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {4771#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4771#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:30,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {4771#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4772#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:30,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {4772#(<= main_~a~0 3)} assume true; {4772#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:30,274 INFO L273 TraceCheckUtils]: 16: Hoare triple {4772#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4772#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:30,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {4772#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4773#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:30,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {4773#(<= main_~a~0 4)} assume true; {4773#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:30,276 INFO L273 TraceCheckUtils]: 19: Hoare triple {4773#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4773#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:30,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {4773#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4774#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:30,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {4774#(<= main_~a~0 5)} assume true; {4774#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:30,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {4774#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4774#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:30,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {4774#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4775#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:30,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {4775#(<= main_~a~0 6)} assume true; {4775#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:30,279 INFO L273 TraceCheckUtils]: 25: Hoare triple {4775#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4775#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:30,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {4775#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4776#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:30,281 INFO L273 TraceCheckUtils]: 27: Hoare triple {4776#(<= main_~a~0 7)} assume true; {4776#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:30,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {4776#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4776#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:30,282 INFO L273 TraceCheckUtils]: 29: Hoare triple {4776#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4777#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:30,282 INFO L273 TraceCheckUtils]: 30: Hoare triple {4777#(<= main_~a~0 8)} assume true; {4777#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:30,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {4777#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4777#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:30,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {4777#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4778#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:30,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {4778#(<= main_~a~0 9)} assume true; {4778#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:30,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {4778#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4778#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:30,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {4778#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4779#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:30,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {4779#(<= main_~a~0 10)} assume true; {4779#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:30,287 INFO L273 TraceCheckUtils]: 37: Hoare triple {4779#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4779#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:30,287 INFO L273 TraceCheckUtils]: 38: Hoare triple {4779#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4780#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:30,288 INFO L273 TraceCheckUtils]: 39: Hoare triple {4780#(<= main_~a~0 11)} assume true; {4780#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:30,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {4780#(<= main_~a~0 11)} assume !(~a~0 < 100000); {4768#false} is VALID [2018-11-18 22:43:30,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {4768#false} havoc ~i~0;~i~0 := 0; {4768#false} is VALID [2018-11-18 22:43:30,289 INFO L273 TraceCheckUtils]: 42: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:30,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:30,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:30,290 INFO L273 TraceCheckUtils]: 45: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:30,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:30,290 INFO L273 TraceCheckUtils]: 47: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:30,290 INFO L273 TraceCheckUtils]: 48: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:30,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:30,291 INFO L273 TraceCheckUtils]: 50: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:30,291 INFO L273 TraceCheckUtils]: 51: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:30,291 INFO L273 TraceCheckUtils]: 52: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:30,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 54: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 55: Hoare triple {4768#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 56: Hoare triple {4768#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 58: Hoare triple {4768#false} assume !(~i~0 < 100000); {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 59: Hoare triple {4768#false} havoc ~x~0;~x~0 := 0; {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {4768#false} assume true; {4768#false} is VALID [2018-11-18 22:43:30,292 INFO L273 TraceCheckUtils]: 61: Hoare triple {4768#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4768#false} is VALID [2018-11-18 22:43:30,293 INFO L256 TraceCheckUtils]: 62: Hoare triple {4768#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4768#false} is VALID [2018-11-18 22:43:30,293 INFO L273 TraceCheckUtils]: 63: Hoare triple {4768#false} ~cond := #in~cond; {4768#false} is VALID [2018-11-18 22:43:30,293 INFO L273 TraceCheckUtils]: 64: Hoare triple {4768#false} assume 0 == ~cond; {4768#false} is VALID [2018-11-18 22:43:30,293 INFO L273 TraceCheckUtils]: 65: Hoare triple {4768#false} assume !false; {4768#false} is VALID [2018-11-18 22:43:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 22:43:30,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:30,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:43:30,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2018-11-18 22:43:30,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:30,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:43:30,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:30,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:43:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:43:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:43:30,374 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 15 states. [2018-11-18 22:43:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:30,864 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-18 22:43:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:43:30,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2018-11-18 22:43:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:43:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-18 22:43:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:43:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-18 22:43:30,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 81 transitions. [2018-11-18 22:43:31,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:31,348 INFO L225 Difference]: With dead ends: 105 [2018-11-18 22:43:31,348 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 22:43:31,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:43:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 22:43:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-18 22:43:31,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:31,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-18 22:43:31,402 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-18 22:43:31,402 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-18 22:43:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:31,404 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 22:43:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:43:31,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:31,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:31,405 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-18 22:43:31,405 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-18 22:43:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:31,406 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 22:43:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 22:43:31,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:31,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:31,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:31,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 22:43:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-18 22:43:31,409 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 66 [2018-11-18 22:43:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:31,409 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-18 22:43:31,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:43:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-18 22:43:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 22:43:31,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:31,410 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:31,411 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:31,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1087822420, now seen corresponding path program 12 times [2018-11-18 22:43:31,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:31,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:31,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:31,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:31,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:32,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {5369#true} call ULTIMATE.init(); {5369#true} is VALID [2018-11-18 22:43:32,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {5369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5369#true} is VALID [2018-11-18 22:43:32,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:32,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5369#true} {5369#true} #66#return; {5369#true} is VALID [2018-11-18 22:43:32,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {5369#true} call #t~ret8 := main(); {5369#true} is VALID [2018-11-18 22:43:32,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {5369#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5371#(= main_~a~0 0)} is VALID [2018-11-18 22:43:32,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {5371#(= main_~a~0 0)} assume true; {5371#(= main_~a~0 0)} is VALID [2018-11-18 22:43:32,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {5371#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5371#(= main_~a~0 0)} is VALID [2018-11-18 22:43:32,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {5371#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5372#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:32,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {5372#(<= main_~a~0 1)} assume true; {5372#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:32,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {5372#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5372#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:32,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {5372#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5373#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:32,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {5373#(<= main_~a~0 2)} assume true; {5373#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:32,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {5373#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5373#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:32,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {5373#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5374#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:32,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {5374#(<= main_~a~0 3)} assume true; {5374#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:32,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {5374#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5374#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:32,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {5374#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5375#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:32,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {5375#(<= main_~a~0 4)} assume true; {5375#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:32,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {5375#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5375#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:32,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {5375#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5376#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:32,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {5376#(<= main_~a~0 5)} assume true; {5376#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:32,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {5376#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5376#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:32,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {5376#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5377#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:32,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {5377#(<= main_~a~0 6)} assume true; {5377#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:32,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {5377#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5377#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:32,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {5377#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5378#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:32,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {5378#(<= main_~a~0 7)} assume true; {5378#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:32,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {5378#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5378#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:32,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {5378#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5379#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:32,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {5379#(<= main_~a~0 8)} assume true; {5379#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:32,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {5379#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5379#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:32,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {5379#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5380#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:32,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {5380#(<= main_~a~0 9)} assume true; {5380#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:32,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {5380#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5380#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:32,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {5380#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5381#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:32,191 INFO L273 TraceCheckUtils]: 36: Hoare triple {5381#(<= main_~a~0 10)} assume true; {5381#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:32,191 INFO L273 TraceCheckUtils]: 37: Hoare triple {5381#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5381#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:32,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {5381#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5382#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:32,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {5382#(<= main_~a~0 11)} assume true; {5382#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:32,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {5382#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5382#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:32,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {5382#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5383#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:32,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {5383#(<= main_~a~0 12)} assume true; {5383#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:32,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {5383#(<= main_~a~0 12)} assume !(~a~0 < 100000); {5370#false} is VALID [2018-11-18 22:43:32,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {5370#false} havoc ~i~0;~i~0 := 0; {5370#false} is VALID [2018-11-18 22:43:32,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:32,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {5370#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5370#false} is VALID [2018-11-18 22:43:32,196 INFO L273 TraceCheckUtils]: 47: Hoare triple {5370#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5370#false} is VALID [2018-11-18 22:43:32,196 INFO L273 TraceCheckUtils]: 48: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:32,196 INFO L273 TraceCheckUtils]: 49: Hoare triple {5370#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5370#false} is VALID [2018-11-18 22:43:32,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {5370#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5370#false} is VALID [2018-11-18 22:43:32,197 INFO L273 TraceCheckUtils]: 51: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:32,197 INFO L273 TraceCheckUtils]: 52: Hoare triple {5370#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5370#false} is VALID [2018-11-18 22:43:32,197 INFO L273 TraceCheckUtils]: 53: Hoare triple {5370#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5370#false} is VALID [2018-11-18 22:43:32,197 INFO L273 TraceCheckUtils]: 54: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:32,197 INFO L273 TraceCheckUtils]: 55: Hoare triple {5370#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 56: Hoare triple {5370#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 57: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 58: Hoare triple {5370#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 59: Hoare triple {5370#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 60: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 61: Hoare triple {5370#false} assume !(~i~0 < 100000); {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 62: Hoare triple {5370#false} havoc ~x~0;~x~0 := 0; {5370#false} is VALID [2018-11-18 22:43:32,198 INFO L273 TraceCheckUtils]: 63: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:32,199 INFO L273 TraceCheckUtils]: 64: Hoare triple {5370#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5370#false} is VALID [2018-11-18 22:43:32,199 INFO L256 TraceCheckUtils]: 65: Hoare triple {5370#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5370#false} is VALID [2018-11-18 22:43:32,199 INFO L273 TraceCheckUtils]: 66: Hoare triple {5370#false} ~cond := #in~cond; {5370#false} is VALID [2018-11-18 22:43:32,199 INFO L273 TraceCheckUtils]: 67: Hoare triple {5370#false} assume 0 == ~cond; {5370#false} is VALID [2018-11-18 22:43:32,199 INFO L273 TraceCheckUtils]: 68: Hoare triple {5370#false} assume !false; {5370#false} is VALID [2018-11-18 22:43:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 22:43:32,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:32,202 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-18 22:43:32,211 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:43:33,343 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-18 22:43:33,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:33,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:33,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {5369#true} call ULTIMATE.init(); {5369#true} is VALID [2018-11-18 22:43:33,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {5369#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5369#true} is VALID [2018-11-18 22:43:33,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5369#true} {5369#true} #66#return; {5369#true} is VALID [2018-11-18 22:43:33,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {5369#true} call #t~ret8 := main(); {5369#true} is VALID [2018-11-18 22:43:33,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {5369#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5369#true} is VALID [2018-11-18 22:43:33,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 27: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,512 INFO L273 TraceCheckUtils]: 37: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {5369#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5369#true} is VALID [2018-11-18 22:43:33,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {5369#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5369#true} is VALID [2018-11-18 22:43:33,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {5369#true} assume true; {5369#true} is VALID [2018-11-18 22:43:33,513 INFO L273 TraceCheckUtils]: 43: Hoare triple {5369#true} assume !(~a~0 < 100000); {5369#true} is VALID [2018-11-18 22:43:33,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {5369#true} havoc ~i~0;~i~0 := 0; {5519#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:33,514 INFO L273 TraceCheckUtils]: 45: Hoare triple {5519#(<= main_~i~0 0)} assume true; {5519#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:33,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {5519#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5519#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:33,515 INFO L273 TraceCheckUtils]: 47: Hoare triple {5519#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5529#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:33,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {5529#(<= main_~i~0 1)} assume true; {5529#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:33,515 INFO L273 TraceCheckUtils]: 49: Hoare triple {5529#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5529#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:33,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {5529#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5539#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:33,516 INFO L273 TraceCheckUtils]: 51: Hoare triple {5539#(<= main_~i~0 2)} assume true; {5539#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:33,517 INFO L273 TraceCheckUtils]: 52: Hoare triple {5539#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5539#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:33,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {5539#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5549#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:33,518 INFO L273 TraceCheckUtils]: 54: Hoare triple {5549#(<= main_~i~0 3)} assume true; {5549#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:33,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {5549#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5549#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:33,519 INFO L273 TraceCheckUtils]: 56: Hoare triple {5549#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5559#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:33,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {5559#(<= main_~i~0 4)} assume true; {5559#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:33,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {5559#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5559#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:33,521 INFO L273 TraceCheckUtils]: 59: Hoare triple {5559#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5569#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:33,522 INFO L273 TraceCheckUtils]: 60: Hoare triple {5569#(<= main_~i~0 5)} assume true; {5569#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:33,522 INFO L273 TraceCheckUtils]: 61: Hoare triple {5569#(<= main_~i~0 5)} assume !(~i~0 < 100000); {5370#false} is VALID [2018-11-18 22:43:33,523 INFO L273 TraceCheckUtils]: 62: Hoare triple {5370#false} havoc ~x~0;~x~0 := 0; {5370#false} is VALID [2018-11-18 22:43:33,523 INFO L273 TraceCheckUtils]: 63: Hoare triple {5370#false} assume true; {5370#false} is VALID [2018-11-18 22:43:33,523 INFO L273 TraceCheckUtils]: 64: Hoare triple {5370#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5370#false} is VALID [2018-11-18 22:43:33,523 INFO L256 TraceCheckUtils]: 65: Hoare triple {5370#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5370#false} is VALID [2018-11-18 22:43:33,523 INFO L273 TraceCheckUtils]: 66: Hoare triple {5370#false} ~cond := #in~cond; {5370#false} is VALID [2018-11-18 22:43:33,524 INFO L273 TraceCheckUtils]: 67: Hoare triple {5370#false} assume 0 == ~cond; {5370#false} is VALID [2018-11-18 22:43:33,524 INFO L273 TraceCheckUtils]: 68: Hoare triple {5370#false} assume !false; {5370#false} is VALID [2018-11-18 22:43:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-18 22:43:33,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:33,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-18 22:43:33,548 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-11-18 22:43:33,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:33,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:43:33,620 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-18 22:43:33,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:43:33,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:43:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:43:33,621 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 21 states. [2018-11-18 22:43:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:34,338 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-18 22:43:34,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:43:34,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-11-18 22:43:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2018-11-18 22:43:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:43:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2018-11-18 22:43:34,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 103 transitions. [2018-11-18 22:43:35,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:35,187 INFO L225 Difference]: With dead ends: 112 [2018-11-18 22:43:35,187 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 22:43:35,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:43:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 22:43:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-18 22:43:35,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:35,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2018-11-18 22:43:35,226 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2018-11-18 22:43:35,227 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2018-11-18 22:43:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:35,228 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-18 22:43:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-18 22:43:35,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:35,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:35,229 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2018-11-18 22:43:35,229 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2018-11-18 22:43:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:35,231 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-18 22:43:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-18 22:43:35,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:35,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:35,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:35,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 22:43:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-18 22:43:35,234 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 69 [2018-11-18 22:43:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:35,234 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-18 22:43:35,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:43:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-18 22:43:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 22:43:35,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:35,235 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:35,236 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:35,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash -971770961, now seen corresponding path program 13 times [2018-11-18 22:43:35,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:35,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:35,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:36,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {6017#true} call ULTIMATE.init(); {6017#true} is VALID [2018-11-18 22:43:36,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {6017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6017#true} is VALID [2018-11-18 22:43:36,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {6017#true} assume true; {6017#true} is VALID [2018-11-18 22:43:36,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6017#true} {6017#true} #66#return; {6017#true} is VALID [2018-11-18 22:43:36,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {6017#true} call #t~ret8 := main(); {6017#true} is VALID [2018-11-18 22:43:36,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {6017#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6019#(= main_~a~0 0)} is VALID [2018-11-18 22:43:36,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {6019#(= main_~a~0 0)} assume true; {6019#(= main_~a~0 0)} is VALID [2018-11-18 22:43:36,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {6019#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6019#(= main_~a~0 0)} is VALID [2018-11-18 22:43:36,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {6019#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6020#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:36,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {6020#(<= main_~a~0 1)} assume true; {6020#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:36,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {6020#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6020#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:36,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {6020#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6021#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:36,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {6021#(<= main_~a~0 2)} assume true; {6021#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:36,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {6021#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6021#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:36,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {6021#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6022#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:36,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {6022#(<= main_~a~0 3)} assume true; {6022#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:36,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {6022#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6022#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:36,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {6022#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6023#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:36,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {6023#(<= main_~a~0 4)} assume true; {6023#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:36,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {6023#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6023#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:36,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {6023#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6024#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:36,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {6024#(<= main_~a~0 5)} assume true; {6024#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:36,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {6024#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6024#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:36,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {6024#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6025#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:36,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {6025#(<= main_~a~0 6)} assume true; {6025#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:36,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {6025#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6025#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:36,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {6025#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6026#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:36,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {6026#(<= main_~a~0 7)} assume true; {6026#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:36,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {6026#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6026#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:36,918 INFO L273 TraceCheckUtils]: 29: Hoare triple {6026#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6027#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:36,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {6027#(<= main_~a~0 8)} assume true; {6027#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:36,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {6027#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6027#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:36,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {6027#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6028#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:36,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {6028#(<= main_~a~0 9)} assume true; {6028#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:36,927 INFO L273 TraceCheckUtils]: 34: Hoare triple {6028#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6028#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:36,927 INFO L273 TraceCheckUtils]: 35: Hoare triple {6028#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6029#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:36,930 INFO L273 TraceCheckUtils]: 36: Hoare triple {6029#(<= main_~a~0 10)} assume true; {6029#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:36,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {6029#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6029#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:36,932 INFO L273 TraceCheckUtils]: 38: Hoare triple {6029#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6030#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:36,932 INFO L273 TraceCheckUtils]: 39: Hoare triple {6030#(<= main_~a~0 11)} assume true; {6030#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:36,935 INFO L273 TraceCheckUtils]: 40: Hoare triple {6030#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6030#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:36,935 INFO L273 TraceCheckUtils]: 41: Hoare triple {6030#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6031#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:36,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {6031#(<= main_~a~0 12)} assume true; {6031#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:36,937 INFO L273 TraceCheckUtils]: 43: Hoare triple {6031#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6031#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:36,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {6031#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6032#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:36,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {6032#(<= main_~a~0 13)} assume true; {6032#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:36,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {6032#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6018#false} is VALID [2018-11-18 22:43:36,943 INFO L273 TraceCheckUtils]: 47: Hoare triple {6018#false} havoc ~i~0;~i~0 := 0; {6018#false} is VALID [2018-11-18 22:43:36,943 INFO L273 TraceCheckUtils]: 48: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,943 INFO L273 TraceCheckUtils]: 49: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:36,943 INFO L273 TraceCheckUtils]: 50: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:36,943 INFO L273 TraceCheckUtils]: 51: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,943 INFO L273 TraceCheckUtils]: 52: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 53: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 54: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 55: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 56: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 57: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 58: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 59: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 60: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,944 INFO L273 TraceCheckUtils]: 61: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 62: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 63: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 64: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 65: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 66: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 67: Hoare triple {6018#false} assume !(~i~0 < 100000); {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 68: Hoare triple {6018#false} havoc ~x~0;~x~0 := 0; {6018#false} is VALID [2018-11-18 22:43:36,945 INFO L273 TraceCheckUtils]: 69: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:36,946 INFO L273 TraceCheckUtils]: 70: Hoare triple {6018#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6018#false} is VALID [2018-11-18 22:43:36,946 INFO L256 TraceCheckUtils]: 71: Hoare triple {6018#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6018#false} is VALID [2018-11-18 22:43:36,946 INFO L273 TraceCheckUtils]: 72: Hoare triple {6018#false} ~cond := #in~cond; {6018#false} is VALID [2018-11-18 22:43:36,946 INFO L273 TraceCheckUtils]: 73: Hoare triple {6018#false} assume 0 == ~cond; {6018#false} is VALID [2018-11-18 22:43:36,946 INFO L273 TraceCheckUtils]: 74: Hoare triple {6018#false} assume !false; {6018#false} is VALID [2018-11-18 22:43:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 22:43:36,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:36,949 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-18 22:43:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:37,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:37,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {6017#true} call ULTIMATE.init(); {6017#true} is VALID [2018-11-18 22:43:37,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {6017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6017#true} is VALID [2018-11-18 22:43:37,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {6017#true} assume true; {6017#true} is VALID [2018-11-18 22:43:37,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6017#true} {6017#true} #66#return; {6017#true} is VALID [2018-11-18 22:43:37,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {6017#true} call #t~ret8 := main(); {6017#true} is VALID [2018-11-18 22:43:37,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {6017#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6051#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:37,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {6051#(<= main_~a~0 0)} assume true; {6051#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:37,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {6051#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6051#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:37,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {6051#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6020#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:37,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {6020#(<= main_~a~0 1)} assume true; {6020#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:37,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {6020#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6020#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:37,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {6020#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6021#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:37,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {6021#(<= main_~a~0 2)} assume true; {6021#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:37,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {6021#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6021#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:37,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {6021#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6022#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:37,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {6022#(<= main_~a~0 3)} assume true; {6022#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:37,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {6022#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6022#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:37,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {6022#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6023#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:37,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {6023#(<= main_~a~0 4)} assume true; {6023#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:37,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {6023#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6023#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:37,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {6023#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6024#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:37,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {6024#(<= main_~a~0 5)} assume true; {6024#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:37,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {6024#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6024#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:37,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {6024#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6025#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:37,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {6025#(<= main_~a~0 6)} assume true; {6025#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:37,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {6025#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6025#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:37,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {6025#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6026#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:37,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {6026#(<= main_~a~0 7)} assume true; {6026#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:37,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {6026#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6026#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:37,182 INFO L273 TraceCheckUtils]: 29: Hoare triple {6026#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6027#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:37,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {6027#(<= main_~a~0 8)} assume true; {6027#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:37,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {6027#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6027#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:37,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {6027#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6028#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:37,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {6028#(<= main_~a~0 9)} assume true; {6028#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:37,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {6028#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6028#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:37,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {6028#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6029#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:37,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {6029#(<= main_~a~0 10)} assume true; {6029#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:37,188 INFO L273 TraceCheckUtils]: 37: Hoare triple {6029#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6029#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:37,188 INFO L273 TraceCheckUtils]: 38: Hoare triple {6029#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6030#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:37,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {6030#(<= main_~a~0 11)} assume true; {6030#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:37,189 INFO L273 TraceCheckUtils]: 40: Hoare triple {6030#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6030#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:37,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {6030#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6031#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:37,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {6031#(<= main_~a~0 12)} assume true; {6031#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:37,191 INFO L273 TraceCheckUtils]: 43: Hoare triple {6031#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6031#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:37,192 INFO L273 TraceCheckUtils]: 44: Hoare triple {6031#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6032#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:37,193 INFO L273 TraceCheckUtils]: 45: Hoare triple {6032#(<= main_~a~0 13)} assume true; {6032#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:37,193 INFO L273 TraceCheckUtils]: 46: Hoare triple {6032#(<= main_~a~0 13)} assume !(~a~0 < 100000); {6018#false} is VALID [2018-11-18 22:43:37,194 INFO L273 TraceCheckUtils]: 47: Hoare triple {6018#false} havoc ~i~0;~i~0 := 0; {6018#false} is VALID [2018-11-18 22:43:37,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,194 INFO L273 TraceCheckUtils]: 49: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:37,194 INFO L273 TraceCheckUtils]: 50: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:37,194 INFO L273 TraceCheckUtils]: 51: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,195 INFO L273 TraceCheckUtils]: 52: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:37,195 INFO L273 TraceCheckUtils]: 53: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:37,195 INFO L273 TraceCheckUtils]: 54: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,195 INFO L273 TraceCheckUtils]: 55: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:37,195 INFO L273 TraceCheckUtils]: 56: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:37,196 INFO L273 TraceCheckUtils]: 57: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,196 INFO L273 TraceCheckUtils]: 58: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:37,196 INFO L273 TraceCheckUtils]: 59: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:37,196 INFO L273 TraceCheckUtils]: 60: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,196 INFO L273 TraceCheckUtils]: 61: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:37,196 INFO L273 TraceCheckUtils]: 62: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:37,196 INFO L273 TraceCheckUtils]: 63: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,197 INFO L273 TraceCheckUtils]: 64: Hoare triple {6018#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6018#false} is VALID [2018-11-18 22:43:37,197 INFO L273 TraceCheckUtils]: 65: Hoare triple {6018#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#false} is VALID [2018-11-18 22:43:37,197 INFO L273 TraceCheckUtils]: 66: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,197 INFO L273 TraceCheckUtils]: 67: Hoare triple {6018#false} assume !(~i~0 < 100000); {6018#false} is VALID [2018-11-18 22:43:37,197 INFO L273 TraceCheckUtils]: 68: Hoare triple {6018#false} havoc ~x~0;~x~0 := 0; {6018#false} is VALID [2018-11-18 22:43:37,197 INFO L273 TraceCheckUtils]: 69: Hoare triple {6018#false} assume true; {6018#false} is VALID [2018-11-18 22:43:37,197 INFO L273 TraceCheckUtils]: 70: Hoare triple {6018#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6018#false} is VALID [2018-11-18 22:43:37,198 INFO L256 TraceCheckUtils]: 71: Hoare triple {6018#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6018#false} is VALID [2018-11-18 22:43:37,198 INFO L273 TraceCheckUtils]: 72: Hoare triple {6018#false} ~cond := #in~cond; {6018#false} is VALID [2018-11-18 22:43:37,198 INFO L273 TraceCheckUtils]: 73: Hoare triple {6018#false} assume 0 == ~cond; {6018#false} is VALID [2018-11-18 22:43:37,198 INFO L273 TraceCheckUtils]: 74: Hoare triple {6018#false} assume !false; {6018#false} is VALID [2018-11-18 22:43:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 22:43:37,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:37,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:43:37,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-11-18 22:43:37,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:37,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:43:37,289 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-18 22:43:37,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:43:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:43:37,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:43:37,290 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 17 states. [2018-11-18 22:43:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:37,683 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-18 22:43:37,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:43:37,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-11-18 22:43:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:43:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-18 22:43:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:43:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2018-11-18 22:43:37,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 87 transitions. [2018-11-18 22:43:38,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:38,192 INFO L225 Difference]: With dead ends: 117 [2018-11-18 22:43:38,192 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 22:43:38,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:43:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 22:43:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-18 22:43:38,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:38,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-18 22:43:38,215 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-18 22:43:38,215 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-18 22:43:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:38,217 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-18 22:43:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-18 22:43:38,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:38,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:38,218 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-18 22:43:38,218 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-18 22:43:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:38,220 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-18 22:43:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-18 22:43:38,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:38,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:38,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:38,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 22:43:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-18 22:43:38,223 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 75 [2018-11-18 22:43:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:38,223 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-18 22:43:38,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:43:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 22:43:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 22:43:38,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:38,224 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:38,225 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:38,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -923316758, now seen corresponding path program 14 times [2018-11-18 22:43:38,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:38,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:43:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:38,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6694#true} is VALID [2018-11-18 22:43:38,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {6694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6694#true} is VALID [2018-11-18 22:43:38,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2018-11-18 22:43:38,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #66#return; {6694#true} is VALID [2018-11-18 22:43:38,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret8 := main(); {6694#true} is VALID [2018-11-18 22:43:38,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {6694#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6696#(= main_~a~0 0)} is VALID [2018-11-18 22:43:38,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {6696#(= main_~a~0 0)} assume true; {6696#(= main_~a~0 0)} is VALID [2018-11-18 22:43:38,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {6696#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6696#(= main_~a~0 0)} is VALID [2018-11-18 22:43:38,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {6696#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6697#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:38,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {6697#(<= main_~a~0 1)} assume true; {6697#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:38,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {6697#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6697#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:38,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {6697#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6698#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:38,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {6698#(<= main_~a~0 2)} assume true; {6698#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:38,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {6698#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6698#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:38,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {6698#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6699#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:38,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {6699#(<= main_~a~0 3)} assume true; {6699#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:38,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {6699#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6699#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:38,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {6699#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6700#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:38,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {6700#(<= main_~a~0 4)} assume true; {6700#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:38,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {6700#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6700#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:38,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {6700#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6701#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:38,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {6701#(<= main_~a~0 5)} assume true; {6701#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:38,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {6701#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6701#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:38,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {6701#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6702#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:38,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {6702#(<= main_~a~0 6)} assume true; {6702#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:38,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {6702#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6702#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:38,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {6702#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:38,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {6703#(<= main_~a~0 7)} assume true; {6703#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:38,933 INFO L273 TraceCheckUtils]: 28: Hoare triple {6703#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:38,933 INFO L273 TraceCheckUtils]: 29: Hoare triple {6703#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6704#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:38,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {6704#(<= main_~a~0 8)} assume true; {6704#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:38,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {6704#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6704#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:38,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {6704#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6705#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:38,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {6705#(<= main_~a~0 9)} assume true; {6705#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:38,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {6705#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6705#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:38,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {6705#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6706#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:38,938 INFO L273 TraceCheckUtils]: 36: Hoare triple {6706#(<= main_~a~0 10)} assume true; {6706#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:38,938 INFO L273 TraceCheckUtils]: 37: Hoare triple {6706#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6706#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:38,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {6706#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6707#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:38,939 INFO L273 TraceCheckUtils]: 39: Hoare triple {6707#(<= main_~a~0 11)} assume true; {6707#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:38,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {6707#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6707#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:38,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {6707#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6708#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:38,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {6708#(<= main_~a~0 12)} assume true; {6708#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:38,942 INFO L273 TraceCheckUtils]: 43: Hoare triple {6708#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6708#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:38,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {6708#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6709#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:38,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {6709#(<= main_~a~0 13)} assume true; {6709#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:38,944 INFO L273 TraceCheckUtils]: 46: Hoare triple {6709#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6709#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:38,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {6709#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6710#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:38,945 INFO L273 TraceCheckUtils]: 48: Hoare triple {6710#(<= main_~a~0 14)} assume true; {6710#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:38,946 INFO L273 TraceCheckUtils]: 49: Hoare triple {6710#(<= main_~a~0 14)} assume !(~a~0 < 100000); {6695#false} is VALID [2018-11-18 22:43:38,946 INFO L273 TraceCheckUtils]: 50: Hoare triple {6695#false} havoc ~i~0;~i~0 := 0; {6695#false} is VALID [2018-11-18 22:43:38,946 INFO L273 TraceCheckUtils]: 51: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,946 INFO L273 TraceCheckUtils]: 52: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:38,946 INFO L273 TraceCheckUtils]: 53: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:38,947 INFO L273 TraceCheckUtils]: 54: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,947 INFO L273 TraceCheckUtils]: 55: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:38,947 INFO L273 TraceCheckUtils]: 56: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:38,947 INFO L273 TraceCheckUtils]: 57: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,947 INFO L273 TraceCheckUtils]: 58: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:38,948 INFO L273 TraceCheckUtils]: 59: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:38,948 INFO L273 TraceCheckUtils]: 60: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,948 INFO L273 TraceCheckUtils]: 61: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:38,948 INFO L273 TraceCheckUtils]: 62: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:38,948 INFO L273 TraceCheckUtils]: 63: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,949 INFO L273 TraceCheckUtils]: 64: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:38,949 INFO L273 TraceCheckUtils]: 65: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:38,949 INFO L273 TraceCheckUtils]: 66: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,949 INFO L273 TraceCheckUtils]: 67: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:38,949 INFO L273 TraceCheckUtils]: 68: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:38,949 INFO L273 TraceCheckUtils]: 69: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L273 TraceCheckUtils]: 70: Hoare triple {6695#false} assume !(~i~0 < 100000); {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L273 TraceCheckUtils]: 71: Hoare triple {6695#false} havoc ~x~0;~x~0 := 0; {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L273 TraceCheckUtils]: 72: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L273 TraceCheckUtils]: 73: Hoare triple {6695#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L256 TraceCheckUtils]: 74: Hoare triple {6695#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L273 TraceCheckUtils]: 75: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L273 TraceCheckUtils]: 76: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2018-11-18 22:43:38,950 INFO L273 TraceCheckUtils]: 77: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2018-11-18 22:43:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 22:43:38,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:38,954 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-18 22:43:38,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:43:39,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:43:39,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:39,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:39,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6694#true} is VALID [2018-11-18 22:43:39,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {6694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6694#true} is VALID [2018-11-18 22:43:39,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2018-11-18 22:43:39,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #66#return; {6694#true} is VALID [2018-11-18 22:43:39,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret8 := main(); {6694#true} is VALID [2018-11-18 22:43:39,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {6694#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6729#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:39,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {6729#(<= main_~a~0 0)} assume true; {6729#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:39,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {6729#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6729#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:39,198 INFO L273 TraceCheckUtils]: 8: Hoare triple {6729#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6697#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:39,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {6697#(<= main_~a~0 1)} assume true; {6697#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:39,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {6697#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6697#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:39,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {6697#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6698#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:39,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {6698#(<= main_~a~0 2)} assume true; {6698#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:39,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {6698#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6698#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:39,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {6698#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6699#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:39,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {6699#(<= main_~a~0 3)} assume true; {6699#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:39,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {6699#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6699#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:39,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {6699#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6700#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:39,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {6700#(<= main_~a~0 4)} assume true; {6700#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:39,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {6700#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6700#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:39,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {6700#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6701#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:39,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {6701#(<= main_~a~0 5)} assume true; {6701#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:39,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {6701#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6701#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:39,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {6701#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6702#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:39,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {6702#(<= main_~a~0 6)} assume true; {6702#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:39,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {6702#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6702#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:39,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {6702#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:39,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {6703#(<= main_~a~0 7)} assume true; {6703#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:39,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {6703#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:39,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {6703#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6704#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:39,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {6704#(<= main_~a~0 8)} assume true; {6704#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:39,260 INFO L273 TraceCheckUtils]: 31: Hoare triple {6704#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6704#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:39,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {6704#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6705#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:39,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {6705#(<= main_~a~0 9)} assume true; {6705#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:39,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {6705#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6705#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:39,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {6705#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6706#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:39,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {6706#(<= main_~a~0 10)} assume true; {6706#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:39,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {6706#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6706#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:39,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {6706#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6707#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:39,265 INFO L273 TraceCheckUtils]: 39: Hoare triple {6707#(<= main_~a~0 11)} assume true; {6707#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:39,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {6707#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6707#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:39,267 INFO L273 TraceCheckUtils]: 41: Hoare triple {6707#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6708#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:39,267 INFO L273 TraceCheckUtils]: 42: Hoare triple {6708#(<= main_~a~0 12)} assume true; {6708#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:39,268 INFO L273 TraceCheckUtils]: 43: Hoare triple {6708#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6708#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:39,268 INFO L273 TraceCheckUtils]: 44: Hoare triple {6708#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6709#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:39,269 INFO L273 TraceCheckUtils]: 45: Hoare triple {6709#(<= main_~a~0 13)} assume true; {6709#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:39,269 INFO L273 TraceCheckUtils]: 46: Hoare triple {6709#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6709#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:39,270 INFO L273 TraceCheckUtils]: 47: Hoare triple {6709#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6710#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:39,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {6710#(<= main_~a~0 14)} assume true; {6710#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:39,271 INFO L273 TraceCheckUtils]: 49: Hoare triple {6710#(<= main_~a~0 14)} assume !(~a~0 < 100000); {6695#false} is VALID [2018-11-18 22:43:39,272 INFO L273 TraceCheckUtils]: 50: Hoare triple {6695#false} havoc ~i~0;~i~0 := 0; {6695#false} is VALID [2018-11-18 22:43:39,272 INFO L273 TraceCheckUtils]: 51: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,272 INFO L273 TraceCheckUtils]: 52: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:39,272 INFO L273 TraceCheckUtils]: 53: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:39,272 INFO L273 TraceCheckUtils]: 54: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,273 INFO L273 TraceCheckUtils]: 55: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:39,273 INFO L273 TraceCheckUtils]: 56: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:39,273 INFO L273 TraceCheckUtils]: 57: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,273 INFO L273 TraceCheckUtils]: 58: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:39,273 INFO L273 TraceCheckUtils]: 59: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:39,274 INFO L273 TraceCheckUtils]: 60: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:39,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:39,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,274 INFO L273 TraceCheckUtils]: 64: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:39,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:39,275 INFO L273 TraceCheckUtils]: 66: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,275 INFO L273 TraceCheckUtils]: 67: Hoare triple {6695#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6695#false} is VALID [2018-11-18 22:43:39,275 INFO L273 TraceCheckUtils]: 68: Hoare triple {6695#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6695#false} is VALID [2018-11-18 22:43:39,275 INFO L273 TraceCheckUtils]: 69: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,276 INFO L273 TraceCheckUtils]: 70: Hoare triple {6695#false} assume !(~i~0 < 100000); {6695#false} is VALID [2018-11-18 22:43:39,276 INFO L273 TraceCheckUtils]: 71: Hoare triple {6695#false} havoc ~x~0;~x~0 := 0; {6695#false} is VALID [2018-11-18 22:43:39,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {6695#false} assume true; {6695#false} is VALID [2018-11-18 22:43:39,276 INFO L273 TraceCheckUtils]: 73: Hoare triple {6695#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6695#false} is VALID [2018-11-18 22:43:39,276 INFO L256 TraceCheckUtils]: 74: Hoare triple {6695#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6695#false} is VALID [2018-11-18 22:43:39,277 INFO L273 TraceCheckUtils]: 75: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2018-11-18 22:43:39,277 INFO L273 TraceCheckUtils]: 76: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2018-11-18 22:43:39,277 INFO L273 TraceCheckUtils]: 77: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2018-11-18 22:43:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 22:43:39,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:39,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:43:39,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-11-18 22:43:39,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:39,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:43:39,364 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-18 22:43:39,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:43:39,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:43:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:43:39,366 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 18 states. [2018-11-18 22:43:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:39,738 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-11-18 22:43:39,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:43:39,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-11-18 22:43:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:43:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 90 transitions. [2018-11-18 22:43:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:43:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 90 transitions. [2018-11-18 22:43:39,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 90 transitions. [2018-11-18 22:43:39,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:39,825 INFO L225 Difference]: With dead ends: 120 [2018-11-18 22:43:39,826 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 22:43:39,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:43:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 22:43:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-18 22:43:39,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:39,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-18 22:43:39,848 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-18 22:43:39,848 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-18 22:43:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:39,850 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-18 22:43:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:43:39,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:39,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:39,850 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-18 22:43:39,850 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-18 22:43:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:39,852 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-18 22:43:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-18 22:43:39,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:39,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:39,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:39,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 22:43:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-11-18 22:43:39,854 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 78 [2018-11-18 22:43:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:39,855 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-11-18 22:43:39,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:43:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-18 22:43:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 22:43:39,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:39,856 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:39,856 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:39,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash -533166641, now seen corresponding path program 15 times [2018-11-18 22:43:39,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:39,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:39,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:39,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:39,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:40,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {7395#true} call ULTIMATE.init(); {7395#true} is VALID [2018-11-18 22:43:40,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {7395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7395#true} is VALID [2018-11-18 22:43:40,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7395#true} {7395#true} #66#return; {7395#true} is VALID [2018-11-18 22:43:40,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {7395#true} call #t~ret8 := main(); {7395#true} is VALID [2018-11-18 22:43:40,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {7395#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7397#(= main_~a~0 0)} is VALID [2018-11-18 22:43:40,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {7397#(= main_~a~0 0)} assume true; {7397#(= main_~a~0 0)} is VALID [2018-11-18 22:43:40,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {7397#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7397#(= main_~a~0 0)} is VALID [2018-11-18 22:43:40,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {7397#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7398#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:40,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {7398#(<= main_~a~0 1)} assume true; {7398#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:40,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {7398#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7398#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:40,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {7398#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7399#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:40,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {7399#(<= main_~a~0 2)} assume true; {7399#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:40,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {7399#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7399#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:40,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {7399#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7400#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:40,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {7400#(<= main_~a~0 3)} assume true; {7400#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:40,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {7400#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7400#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:40,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {7400#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7401#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:40,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {7401#(<= main_~a~0 4)} assume true; {7401#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:40,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {7401#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7401#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:40,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {7401#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7402#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:40,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {7402#(<= main_~a~0 5)} assume true; {7402#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:40,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {7402#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7402#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:40,322 INFO L273 TraceCheckUtils]: 23: Hoare triple {7402#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7403#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:40,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {7403#(<= main_~a~0 6)} assume true; {7403#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:40,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {7403#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7403#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:40,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {7403#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7404#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:40,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {7404#(<= main_~a~0 7)} assume true; {7404#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:40,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {7404#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7404#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:40,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {7404#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7405#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:40,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {7405#(<= main_~a~0 8)} assume true; {7405#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:40,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {7405#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7405#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:40,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {7405#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7406#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:40,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {7406#(<= main_~a~0 9)} assume true; {7406#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:40,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {7406#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7406#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:40,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {7406#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7407#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:40,331 INFO L273 TraceCheckUtils]: 36: Hoare triple {7407#(<= main_~a~0 10)} assume true; {7407#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:40,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {7407#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7407#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:40,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {7407#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7408#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:40,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {7408#(<= main_~a~0 11)} assume true; {7408#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:40,334 INFO L273 TraceCheckUtils]: 40: Hoare triple {7408#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7408#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:40,335 INFO L273 TraceCheckUtils]: 41: Hoare triple {7408#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7409#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:40,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {7409#(<= main_~a~0 12)} assume true; {7409#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:40,336 INFO L273 TraceCheckUtils]: 43: Hoare triple {7409#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7409#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:40,337 INFO L273 TraceCheckUtils]: 44: Hoare triple {7409#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7410#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:40,337 INFO L273 TraceCheckUtils]: 45: Hoare triple {7410#(<= main_~a~0 13)} assume true; {7410#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:40,338 INFO L273 TraceCheckUtils]: 46: Hoare triple {7410#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7410#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:40,339 INFO L273 TraceCheckUtils]: 47: Hoare triple {7410#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7411#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:40,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {7411#(<= main_~a~0 14)} assume true; {7411#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:40,340 INFO L273 TraceCheckUtils]: 49: Hoare triple {7411#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7411#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:40,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {7411#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7412#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:40,342 INFO L273 TraceCheckUtils]: 51: Hoare triple {7412#(<= main_~a~0 15)} assume true; {7412#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:40,342 INFO L273 TraceCheckUtils]: 52: Hoare triple {7412#(<= main_~a~0 15)} assume !(~a~0 < 100000); {7396#false} is VALID [2018-11-18 22:43:40,343 INFO L273 TraceCheckUtils]: 53: Hoare triple {7396#false} havoc ~i~0;~i~0 := 0; {7396#false} is VALID [2018-11-18 22:43:40,343 INFO L273 TraceCheckUtils]: 54: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,343 INFO L273 TraceCheckUtils]: 55: Hoare triple {7396#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7396#false} is VALID [2018-11-18 22:43:40,343 INFO L273 TraceCheckUtils]: 56: Hoare triple {7396#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7396#false} is VALID [2018-11-18 22:43:40,344 INFO L273 TraceCheckUtils]: 57: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,344 INFO L273 TraceCheckUtils]: 58: Hoare triple {7396#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7396#false} is VALID [2018-11-18 22:43:40,344 INFO L273 TraceCheckUtils]: 59: Hoare triple {7396#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7396#false} is VALID [2018-11-18 22:43:40,344 INFO L273 TraceCheckUtils]: 60: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,345 INFO L273 TraceCheckUtils]: 61: Hoare triple {7396#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7396#false} is VALID [2018-11-18 22:43:40,345 INFO L273 TraceCheckUtils]: 62: Hoare triple {7396#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7396#false} is VALID [2018-11-18 22:43:40,345 INFO L273 TraceCheckUtils]: 63: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,346 INFO L273 TraceCheckUtils]: 64: Hoare triple {7396#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7396#false} is VALID [2018-11-18 22:43:40,346 INFO L273 TraceCheckUtils]: 65: Hoare triple {7396#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7396#false} is VALID [2018-11-18 22:43:40,346 INFO L273 TraceCheckUtils]: 66: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,346 INFO L273 TraceCheckUtils]: 67: Hoare triple {7396#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7396#false} is VALID [2018-11-18 22:43:40,346 INFO L273 TraceCheckUtils]: 68: Hoare triple {7396#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7396#false} is VALID [2018-11-18 22:43:40,346 INFO L273 TraceCheckUtils]: 69: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,346 INFO L273 TraceCheckUtils]: 70: Hoare triple {7396#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7396#false} is VALID [2018-11-18 22:43:40,347 INFO L273 TraceCheckUtils]: 71: Hoare triple {7396#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7396#false} is VALID [2018-11-18 22:43:40,347 INFO L273 TraceCheckUtils]: 72: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,347 INFO L273 TraceCheckUtils]: 73: Hoare triple {7396#false} assume !(~i~0 < 100000); {7396#false} is VALID [2018-11-18 22:43:40,347 INFO L273 TraceCheckUtils]: 74: Hoare triple {7396#false} havoc ~x~0;~x~0 := 0; {7396#false} is VALID [2018-11-18 22:43:40,347 INFO L273 TraceCheckUtils]: 75: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,347 INFO L273 TraceCheckUtils]: 76: Hoare triple {7396#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7396#false} is VALID [2018-11-18 22:43:40,348 INFO L256 TraceCheckUtils]: 77: Hoare triple {7396#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7396#false} is VALID [2018-11-18 22:43:40,348 INFO L273 TraceCheckUtils]: 78: Hoare triple {7396#false} ~cond := #in~cond; {7396#false} is VALID [2018-11-18 22:43:40,348 INFO L273 TraceCheckUtils]: 79: Hoare triple {7396#false} assume 0 == ~cond; {7396#false} is VALID [2018-11-18 22:43:40,348 INFO L273 TraceCheckUtils]: 80: Hoare triple {7396#false} assume !false; {7396#false} is VALID [2018-11-18 22:43:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 22:43:40,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:40,356 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-18 22:43:40,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:43:40,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 22:43:40,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:40,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:40,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {7395#true} call ULTIMATE.init(); {7395#true} is VALID [2018-11-18 22:43:40,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {7395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7395#true} is VALID [2018-11-18 22:43:40,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7395#true} {7395#true} #66#return; {7395#true} is VALID [2018-11-18 22:43:40,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {7395#true} call #t~ret8 := main(); {7395#true} is VALID [2018-11-18 22:43:40,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {7395#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7395#true} is VALID [2018-11-18 22:43:40,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,776 INFO L273 TraceCheckUtils]: 21: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,777 INFO L273 TraceCheckUtils]: 23: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,777 INFO L273 TraceCheckUtils]: 24: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,777 INFO L273 TraceCheckUtils]: 25: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,779 INFO L273 TraceCheckUtils]: 38: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,779 INFO L273 TraceCheckUtils]: 39: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,779 INFO L273 TraceCheckUtils]: 42: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,779 INFO L273 TraceCheckUtils]: 43: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,780 INFO L273 TraceCheckUtils]: 45: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,780 INFO L273 TraceCheckUtils]: 46: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,780 INFO L273 TraceCheckUtils]: 47: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,780 INFO L273 TraceCheckUtils]: 48: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,780 INFO L273 TraceCheckUtils]: 49: Hoare triple {7395#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7395#true} is VALID [2018-11-18 22:43:40,780 INFO L273 TraceCheckUtils]: 50: Hoare triple {7395#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7395#true} is VALID [2018-11-18 22:43:40,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {7395#true} assume true; {7395#true} is VALID [2018-11-18 22:43:40,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {7395#true} assume !(~a~0 < 100000); {7395#true} is VALID [2018-11-18 22:43:40,781 INFO L273 TraceCheckUtils]: 53: Hoare triple {7395#true} havoc ~i~0;~i~0 := 0; {7575#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:40,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {7575#(<= main_~i~0 0)} assume true; {7575#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:40,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {7575#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7575#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:40,783 INFO L273 TraceCheckUtils]: 56: Hoare triple {7575#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7585#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:40,783 INFO L273 TraceCheckUtils]: 57: Hoare triple {7585#(<= main_~i~0 1)} assume true; {7585#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:40,783 INFO L273 TraceCheckUtils]: 58: Hoare triple {7585#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7585#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:40,784 INFO L273 TraceCheckUtils]: 59: Hoare triple {7585#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7595#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:40,784 INFO L273 TraceCheckUtils]: 60: Hoare triple {7595#(<= main_~i~0 2)} assume true; {7595#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:40,785 INFO L273 TraceCheckUtils]: 61: Hoare triple {7595#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7595#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:40,786 INFO L273 TraceCheckUtils]: 62: Hoare triple {7595#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7605#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:40,786 INFO L273 TraceCheckUtils]: 63: Hoare triple {7605#(<= main_~i~0 3)} assume true; {7605#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:40,787 INFO L273 TraceCheckUtils]: 64: Hoare triple {7605#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7605#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:40,788 INFO L273 TraceCheckUtils]: 65: Hoare triple {7605#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7615#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:40,788 INFO L273 TraceCheckUtils]: 66: Hoare triple {7615#(<= main_~i~0 4)} assume true; {7615#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:40,789 INFO L273 TraceCheckUtils]: 67: Hoare triple {7615#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7615#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:40,790 INFO L273 TraceCheckUtils]: 68: Hoare triple {7615#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7625#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:40,790 INFO L273 TraceCheckUtils]: 69: Hoare triple {7625#(<= main_~i~0 5)} assume true; {7625#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:40,791 INFO L273 TraceCheckUtils]: 70: Hoare triple {7625#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7625#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:40,792 INFO L273 TraceCheckUtils]: 71: Hoare triple {7625#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7635#(<= main_~i~0 6)} is VALID [2018-11-18 22:43:40,793 INFO L273 TraceCheckUtils]: 72: Hoare triple {7635#(<= main_~i~0 6)} assume true; {7635#(<= main_~i~0 6)} is VALID [2018-11-18 22:43:40,793 INFO L273 TraceCheckUtils]: 73: Hoare triple {7635#(<= main_~i~0 6)} assume !(~i~0 < 100000); {7396#false} is VALID [2018-11-18 22:43:40,794 INFO L273 TraceCheckUtils]: 74: Hoare triple {7396#false} havoc ~x~0;~x~0 := 0; {7396#false} is VALID [2018-11-18 22:43:40,794 INFO L273 TraceCheckUtils]: 75: Hoare triple {7396#false} assume true; {7396#false} is VALID [2018-11-18 22:43:40,794 INFO L273 TraceCheckUtils]: 76: Hoare triple {7396#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7396#false} is VALID [2018-11-18 22:43:40,794 INFO L256 TraceCheckUtils]: 77: Hoare triple {7396#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7396#false} is VALID [2018-11-18 22:43:40,795 INFO L273 TraceCheckUtils]: 78: Hoare triple {7396#false} ~cond := #in~cond; {7396#false} is VALID [2018-11-18 22:43:40,795 INFO L273 TraceCheckUtils]: 79: Hoare triple {7396#false} assume 0 == ~cond; {7396#false} is VALID [2018-11-18 22:43:40,795 INFO L273 TraceCheckUtils]: 80: Hoare triple {7396#false} assume !false; {7396#false} is VALID [2018-11-18 22:43:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-18 22:43:40,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:40,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2018-11-18 22:43:40,822 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-11-18 22:43:40,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:40,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:43:40,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:40,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:43:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:43:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:43:40,986 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 25 states. [2018-11-18 22:43:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:41,670 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-18 22:43:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:43:41,670 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-11-18 22:43:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:43:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 115 transitions. [2018-11-18 22:43:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:43:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 115 transitions. [2018-11-18 22:43:41,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 115 transitions. [2018-11-18 22:43:41,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:41,788 INFO L225 Difference]: With dead ends: 127 [2018-11-18 22:43:41,788 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 22:43:41,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:43:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 22:43:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-18 22:43:41,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:41,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-18 22:43:41,891 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-18 22:43:41,891 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-18 22:43:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:41,893 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-18 22:43:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-18 22:43:41,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:41,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:41,893 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-18 22:43:41,894 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-18 22:43:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:41,895 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-18 22:43:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-18 22:43:41,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:41,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:41,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:41,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 22:43:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-18 22:43:41,898 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 81 [2018-11-18 22:43:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:41,898 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-18 22:43:41,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:43:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-18 22:43:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 22:43:41,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:41,900 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:41,900 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:41,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash 513355052, now seen corresponding path program 16 times [2018-11-18 22:43:41,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:41,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:41,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:42,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {8143#true} call ULTIMATE.init(); {8143#true} is VALID [2018-11-18 22:43:42,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {8143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8143#true} is VALID [2018-11-18 22:43:42,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {8143#true} assume true; {8143#true} is VALID [2018-11-18 22:43:42,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8143#true} {8143#true} #66#return; {8143#true} is VALID [2018-11-18 22:43:42,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {8143#true} call #t~ret8 := main(); {8143#true} is VALID [2018-11-18 22:43:42,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {8143#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8145#(= main_~a~0 0)} is VALID [2018-11-18 22:43:42,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {8145#(= main_~a~0 0)} assume true; {8145#(= main_~a~0 0)} is VALID [2018-11-18 22:43:42,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {8145#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8145#(= main_~a~0 0)} is VALID [2018-11-18 22:43:42,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {8145#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8146#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:42,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {8146#(<= main_~a~0 1)} assume true; {8146#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:42,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {8146#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8146#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:42,892 INFO L273 TraceCheckUtils]: 11: Hoare triple {8146#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8147#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:42,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {8147#(<= main_~a~0 2)} assume true; {8147#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:42,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {8147#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8147#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:42,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {8147#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8148#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:42,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {8148#(<= main_~a~0 3)} assume true; {8148#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:42,895 INFO L273 TraceCheckUtils]: 16: Hoare triple {8148#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8148#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:42,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {8148#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8149#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:42,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {8149#(<= main_~a~0 4)} assume true; {8149#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:42,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {8149#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8149#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:42,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {8149#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8150#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:42,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {8150#(<= main_~a~0 5)} assume true; {8150#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:42,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {8150#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8150#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:42,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {8150#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8151#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:42,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {8151#(<= main_~a~0 6)} assume true; {8151#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:42,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {8151#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8151#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:42,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {8151#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8152#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:42,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {8152#(<= main_~a~0 7)} assume true; {8152#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:42,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {8152#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8152#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:42,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {8152#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8153#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:42,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {8153#(<= main_~a~0 8)} assume true; {8153#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:42,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {8153#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8153#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:42,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {8153#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8154#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:42,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {8154#(<= main_~a~0 9)} assume true; {8154#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:42,935 INFO L273 TraceCheckUtils]: 34: Hoare triple {8154#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8154#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:42,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {8154#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8155#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:42,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {8155#(<= main_~a~0 10)} assume true; {8155#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:42,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {8155#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8155#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:42,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {8155#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8156#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:42,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {8156#(<= main_~a~0 11)} assume true; {8156#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:43,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {8156#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8156#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:43,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {8156#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8157#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:43,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {8157#(<= main_~a~0 12)} assume true; {8157#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:43,049 INFO L273 TraceCheckUtils]: 43: Hoare triple {8157#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8157#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:43,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {8157#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:43,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {8158#(<= main_~a~0 13)} assume true; {8158#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:43,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {8158#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:43,096 INFO L273 TraceCheckUtils]: 47: Hoare triple {8158#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8159#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:43,113 INFO L273 TraceCheckUtils]: 48: Hoare triple {8159#(<= main_~a~0 14)} assume true; {8159#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:43,122 INFO L273 TraceCheckUtils]: 49: Hoare triple {8159#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8159#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:43,134 INFO L273 TraceCheckUtils]: 50: Hoare triple {8159#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8160#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:43,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {8160#(<= main_~a~0 15)} assume true; {8160#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:43,160 INFO L273 TraceCheckUtils]: 52: Hoare triple {8160#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8160#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:43,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {8160#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8161#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:43,186 INFO L273 TraceCheckUtils]: 54: Hoare triple {8161#(<= main_~a~0 16)} assume true; {8161#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:43,198 INFO L273 TraceCheckUtils]: 55: Hoare triple {8161#(<= main_~a~0 16)} assume !(~a~0 < 100000); {8144#false} is VALID [2018-11-18 22:43:43,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {8144#false} havoc ~i~0;~i~0 := 0; {8144#false} is VALID [2018-11-18 22:43:43,199 INFO L273 TraceCheckUtils]: 57: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,199 INFO L273 TraceCheckUtils]: 58: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,199 INFO L273 TraceCheckUtils]: 59: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,200 INFO L273 TraceCheckUtils]: 61: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,200 INFO L273 TraceCheckUtils]: 65: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,201 INFO L273 TraceCheckUtils]: 66: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,201 INFO L273 TraceCheckUtils]: 67: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,201 INFO L273 TraceCheckUtils]: 68: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,201 INFO L273 TraceCheckUtils]: 69: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,201 INFO L273 TraceCheckUtils]: 70: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,202 INFO L273 TraceCheckUtils]: 71: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,202 INFO L273 TraceCheckUtils]: 73: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,202 INFO L273 TraceCheckUtils]: 74: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,202 INFO L273 TraceCheckUtils]: 75: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,202 INFO L273 TraceCheckUtils]: 76: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,203 INFO L273 TraceCheckUtils]: 77: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,203 INFO L273 TraceCheckUtils]: 78: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,203 INFO L273 TraceCheckUtils]: 79: Hoare triple {8144#false} assume !(~i~0 < 100000); {8144#false} is VALID [2018-11-18 22:43:43,203 INFO L273 TraceCheckUtils]: 80: Hoare triple {8144#false} havoc ~x~0;~x~0 := 0; {8144#false} is VALID [2018-11-18 22:43:43,203 INFO L273 TraceCheckUtils]: 81: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,204 INFO L273 TraceCheckUtils]: 82: Hoare triple {8144#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8144#false} is VALID [2018-11-18 22:43:43,204 INFO L256 TraceCheckUtils]: 83: Hoare triple {8144#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8144#false} is VALID [2018-11-18 22:43:43,204 INFO L273 TraceCheckUtils]: 84: Hoare triple {8144#false} ~cond := #in~cond; {8144#false} is VALID [2018-11-18 22:43:43,204 INFO L273 TraceCheckUtils]: 85: Hoare triple {8144#false} assume 0 == ~cond; {8144#false} is VALID [2018-11-18 22:43:43,204 INFO L273 TraceCheckUtils]: 86: Hoare triple {8144#false} assume !false; {8144#false} is VALID [2018-11-18 22:43:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-18 22:43:43,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:43,212 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-18 22:43:43,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:43:43,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:43:43,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:43,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:43,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {8143#true} call ULTIMATE.init(); {8143#true} is VALID [2018-11-18 22:43:43,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {8143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8143#true} is VALID [2018-11-18 22:43:43,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {8143#true} assume true; {8143#true} is VALID [2018-11-18 22:43:43,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8143#true} {8143#true} #66#return; {8143#true} is VALID [2018-11-18 22:43:43,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {8143#true} call #t~ret8 := main(); {8143#true} is VALID [2018-11-18 22:43:43,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {8143#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8180#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:43,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {8180#(<= main_~a~0 0)} assume true; {8180#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:43,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {8180#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8180#(<= main_~a~0 0)} is VALID [2018-11-18 22:43:43,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {8180#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8146#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:43,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {8146#(<= main_~a~0 1)} assume true; {8146#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:43,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {8146#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8146#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:43,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {8146#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8147#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:43,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {8147#(<= main_~a~0 2)} assume true; {8147#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:43,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {8147#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8147#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:43,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {8147#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8148#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:43,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {8148#(<= main_~a~0 3)} assume true; {8148#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:43,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {8148#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8148#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:43,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {8148#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8149#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:43,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {8149#(<= main_~a~0 4)} assume true; {8149#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:43,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {8149#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8149#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:43,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {8149#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8150#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:43,960 INFO L273 TraceCheckUtils]: 21: Hoare triple {8150#(<= main_~a~0 5)} assume true; {8150#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:43,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {8150#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8150#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:43,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {8150#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8151#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:43,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {8151#(<= main_~a~0 6)} assume true; {8151#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:43,962 INFO L273 TraceCheckUtils]: 25: Hoare triple {8151#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8151#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:43,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {8151#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8152#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:43,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {8152#(<= main_~a~0 7)} assume true; {8152#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:43,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {8152#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8152#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:43,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {8152#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8153#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:43,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {8153#(<= main_~a~0 8)} assume true; {8153#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:43,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {8153#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8153#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:43,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {8153#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8154#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:43,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {8154#(<= main_~a~0 9)} assume true; {8154#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:43,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {8154#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8154#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:43,968 INFO L273 TraceCheckUtils]: 35: Hoare triple {8154#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8155#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:43,969 INFO L273 TraceCheckUtils]: 36: Hoare triple {8155#(<= main_~a~0 10)} assume true; {8155#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:43,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {8155#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8155#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:43,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {8155#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8156#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:43,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {8156#(<= main_~a~0 11)} assume true; {8156#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:43,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {8156#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8156#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:43,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {8156#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8157#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:43,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {8157#(<= main_~a~0 12)} assume true; {8157#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:43,973 INFO L273 TraceCheckUtils]: 43: Hoare triple {8157#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8157#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:43,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {8157#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8158#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:43,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {8158#(<= main_~a~0 13)} assume true; {8158#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:43,974 INFO L273 TraceCheckUtils]: 46: Hoare triple {8158#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8158#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:43,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {8158#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8159#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:43,976 INFO L273 TraceCheckUtils]: 48: Hoare triple {8159#(<= main_~a~0 14)} assume true; {8159#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:43,976 INFO L273 TraceCheckUtils]: 49: Hoare triple {8159#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8159#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:43,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {8159#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8160#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:43,978 INFO L273 TraceCheckUtils]: 51: Hoare triple {8160#(<= main_~a~0 15)} assume true; {8160#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:43,978 INFO L273 TraceCheckUtils]: 52: Hoare triple {8160#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8160#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:43,979 INFO L273 TraceCheckUtils]: 53: Hoare triple {8160#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8161#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:43,979 INFO L273 TraceCheckUtils]: 54: Hoare triple {8161#(<= main_~a~0 16)} assume true; {8161#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:43,980 INFO L273 TraceCheckUtils]: 55: Hoare triple {8161#(<= main_~a~0 16)} assume !(~a~0 < 100000); {8144#false} is VALID [2018-11-18 22:43:43,980 INFO L273 TraceCheckUtils]: 56: Hoare triple {8144#false} havoc ~i~0;~i~0 := 0; {8144#false} is VALID [2018-11-18 22:43:43,980 INFO L273 TraceCheckUtils]: 57: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,981 INFO L273 TraceCheckUtils]: 58: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,981 INFO L273 TraceCheckUtils]: 59: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,981 INFO L273 TraceCheckUtils]: 60: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,981 INFO L273 TraceCheckUtils]: 61: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,981 INFO L273 TraceCheckUtils]: 62: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,982 INFO L273 TraceCheckUtils]: 64: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,982 INFO L273 TraceCheckUtils]: 65: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,982 INFO L273 TraceCheckUtils]: 66: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,982 INFO L273 TraceCheckUtils]: 67: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 68: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 69: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 70: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 71: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 72: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 73: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 74: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,983 INFO L273 TraceCheckUtils]: 75: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 76: Hoare triple {8144#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 77: Hoare triple {8144#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 78: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 79: Hoare triple {8144#false} assume !(~i~0 < 100000); {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {8144#false} havoc ~x~0;~x~0 := 0; {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 81: Hoare triple {8144#false} assume true; {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 82: Hoare triple {8144#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L256 TraceCheckUtils]: 83: Hoare triple {8144#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8144#false} is VALID [2018-11-18 22:43:43,984 INFO L273 TraceCheckUtils]: 84: Hoare triple {8144#false} ~cond := #in~cond; {8144#false} is VALID [2018-11-18 22:43:43,985 INFO L273 TraceCheckUtils]: 85: Hoare triple {8144#false} assume 0 == ~cond; {8144#false} is VALID [2018-11-18 22:43:43,985 INFO L273 TraceCheckUtils]: 86: Hoare triple {8144#false} assume !false; {8144#false} is VALID [2018-11-18 22:43:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-18 22:43:44,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:44,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:43:44,009 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-11-18 22:43:44,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:44,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:43:44,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:44,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:43:44,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:43:44,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:43:44,082 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 20 states. [2018-11-18 22:43:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:44,302 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-11-18 22:43:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:43:44,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-11-18 22:43:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:43:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2018-11-18 22:43:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:43:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2018-11-18 22:43:44,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 96 transitions. [2018-11-18 22:43:44,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:44,423 INFO L225 Difference]: With dead ends: 132 [2018-11-18 22:43:44,423 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 22:43:44,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:43:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 22:43:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-18 22:43:44,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:44,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-18 22:43:44,452 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-18 22:43:44,452 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-18 22:43:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:44,454 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-18 22:43:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-18 22:43:44,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:44,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:44,455 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-18 22:43:44,455 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-18 22:43:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:44,456 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-18 22:43:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-18 22:43:44,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:44,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:44,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:44,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 22:43:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-18 22:43:44,458 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 87 [2018-11-18 22:43:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:44,459 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-18 22:43:44,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:43:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-18 22:43:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:43:44,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:44,460 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:44,460 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:44,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash -310901017, now seen corresponding path program 17 times [2018-11-18 22:43:44,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:44,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:44,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {8919#true} call ULTIMATE.init(); {8919#true} is VALID [2018-11-18 22:43:44,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {8919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8919#true} is VALID [2018-11-18 22:43:44,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:44,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8919#true} {8919#true} #66#return; {8919#true} is VALID [2018-11-18 22:43:44,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {8919#true} call #t~ret8 := main(); {8919#true} is VALID [2018-11-18 22:43:44,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {8919#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8921#(= main_~a~0 0)} is VALID [2018-11-18 22:43:44,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {8921#(= main_~a~0 0)} assume true; {8921#(= main_~a~0 0)} is VALID [2018-11-18 22:43:44,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {8921#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8921#(= main_~a~0 0)} is VALID [2018-11-18 22:43:44,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {8921#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8922#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {8922#(<= main_~a~0 1)} assume true; {8922#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {8922#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8922#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:44,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {8922#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8923#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {8923#(<= main_~a~0 2)} assume true; {8923#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {8923#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8923#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:44,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {8923#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8924#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {8924#(<= main_~a~0 3)} assume true; {8924#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {8924#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8924#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:44,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {8924#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8925#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {8925#(<= main_~a~0 4)} assume true; {8925#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {8925#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8925#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:44,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {8925#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8926#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {8926#(<= main_~a~0 5)} assume true; {8926#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {8926#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8926#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:44,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {8926#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8927#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {8927#(<= main_~a~0 6)} assume true; {8927#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {8927#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8927#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:44,774 INFO L273 TraceCheckUtils]: 26: Hoare triple {8927#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8928#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:44,774 INFO L273 TraceCheckUtils]: 27: Hoare triple {8928#(<= main_~a~0 7)} assume true; {8928#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:44,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {8928#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8928#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:44,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {8928#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8929#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:44,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {8929#(<= main_~a~0 8)} assume true; {8929#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:44,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {8929#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8929#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:44,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {8929#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8930#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:44,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {8930#(<= main_~a~0 9)} assume true; {8930#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:44,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {8930#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8930#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:44,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {8930#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8931#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:44,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {8931#(<= main_~a~0 10)} assume true; {8931#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:44,780 INFO L273 TraceCheckUtils]: 37: Hoare triple {8931#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8931#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:44,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {8931#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8932#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:44,781 INFO L273 TraceCheckUtils]: 39: Hoare triple {8932#(<= main_~a~0 11)} assume true; {8932#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:44,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {8932#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8932#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:44,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {8932#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8933#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:44,783 INFO L273 TraceCheckUtils]: 42: Hoare triple {8933#(<= main_~a~0 12)} assume true; {8933#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:44,784 INFO L273 TraceCheckUtils]: 43: Hoare triple {8933#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8933#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:44,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {8933#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8934#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:44,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {8934#(<= main_~a~0 13)} assume true; {8934#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:44,786 INFO L273 TraceCheckUtils]: 46: Hoare triple {8934#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8934#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:44,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {8934#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8935#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:44,787 INFO L273 TraceCheckUtils]: 48: Hoare triple {8935#(<= main_~a~0 14)} assume true; {8935#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:44,787 INFO L273 TraceCheckUtils]: 49: Hoare triple {8935#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8935#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:44,788 INFO L273 TraceCheckUtils]: 50: Hoare triple {8935#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8936#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:44,789 INFO L273 TraceCheckUtils]: 51: Hoare triple {8936#(<= main_~a~0 15)} assume true; {8936#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:44,789 INFO L273 TraceCheckUtils]: 52: Hoare triple {8936#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8936#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:44,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {8936#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8937#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:44,790 INFO L273 TraceCheckUtils]: 54: Hoare triple {8937#(<= main_~a~0 16)} assume true; {8937#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:44,791 INFO L273 TraceCheckUtils]: 55: Hoare triple {8937#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8937#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:44,792 INFO L273 TraceCheckUtils]: 56: Hoare triple {8937#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8938#(<= main_~a~0 17)} is VALID [2018-11-18 22:43:44,792 INFO L273 TraceCheckUtils]: 57: Hoare triple {8938#(<= main_~a~0 17)} assume true; {8938#(<= main_~a~0 17)} is VALID [2018-11-18 22:43:44,793 INFO L273 TraceCheckUtils]: 58: Hoare triple {8938#(<= main_~a~0 17)} assume !(~a~0 < 100000); {8920#false} is VALID [2018-11-18 22:43:44,793 INFO L273 TraceCheckUtils]: 59: Hoare triple {8920#false} havoc ~i~0;~i~0 := 0; {8920#false} is VALID [2018-11-18 22:43:44,793 INFO L273 TraceCheckUtils]: 60: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,794 INFO L273 TraceCheckUtils]: 61: Hoare triple {8920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8920#false} is VALID [2018-11-18 22:43:44,794 INFO L273 TraceCheckUtils]: 62: Hoare triple {8920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8920#false} is VALID [2018-11-18 22:43:44,794 INFO L273 TraceCheckUtils]: 63: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,794 INFO L273 TraceCheckUtils]: 64: Hoare triple {8920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8920#false} is VALID [2018-11-18 22:43:44,794 INFO L273 TraceCheckUtils]: 65: Hoare triple {8920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8920#false} is VALID [2018-11-18 22:43:44,795 INFO L273 TraceCheckUtils]: 66: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,795 INFO L273 TraceCheckUtils]: 67: Hoare triple {8920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8920#false} is VALID [2018-11-18 22:43:44,795 INFO L273 TraceCheckUtils]: 68: Hoare triple {8920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8920#false} is VALID [2018-11-18 22:43:44,795 INFO L273 TraceCheckUtils]: 69: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,795 INFO L273 TraceCheckUtils]: 70: Hoare triple {8920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8920#false} is VALID [2018-11-18 22:43:44,795 INFO L273 TraceCheckUtils]: 71: Hoare triple {8920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 72: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 73: Hoare triple {8920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 74: Hoare triple {8920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 75: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 76: Hoare triple {8920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 77: Hoare triple {8920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 79: Hoare triple {8920#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8920#false} is VALID [2018-11-18 22:43:44,796 INFO L273 TraceCheckUtils]: 80: Hoare triple {8920#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 81: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 82: Hoare triple {8920#false} assume !(~i~0 < 100000); {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 83: Hoare triple {8920#false} havoc ~x~0;~x~0 := 0; {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 84: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 85: Hoare triple {8920#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L256 TraceCheckUtils]: 86: Hoare triple {8920#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 87: Hoare triple {8920#false} ~cond := #in~cond; {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 88: Hoare triple {8920#false} assume 0 == ~cond; {8920#false} is VALID [2018-11-18 22:43:44,797 INFO L273 TraceCheckUtils]: 89: Hoare triple {8920#false} assume !false; {8920#false} is VALID [2018-11-18 22:43:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-18 22:43:44,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:44,802 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-18 22:43:44,811 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:43:48,198 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:43:48,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:43:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:48,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:43:48,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {8919#true} call ULTIMATE.init(); {8919#true} is VALID [2018-11-18 22:43:48,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {8919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8919#true} is VALID [2018-11-18 22:43:48,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8919#true} {8919#true} #66#return; {8919#true} is VALID [2018-11-18 22:43:48,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {8919#true} call #t~ret8 := main(); {8919#true} is VALID [2018-11-18 22:43:48,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {8919#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8919#true} is VALID [2018-11-18 22:43:48,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 36: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 39: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 40: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 41: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 45: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 46: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 52: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,480 INFO L273 TraceCheckUtils]: 54: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {8919#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#true} is VALID [2018-11-18 22:43:48,480 INFO L273 TraceCheckUtils]: 56: Hoare triple {8919#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#true} is VALID [2018-11-18 22:43:48,480 INFO L273 TraceCheckUtils]: 57: Hoare triple {8919#true} assume true; {8919#true} is VALID [2018-11-18 22:43:48,480 INFO L273 TraceCheckUtils]: 58: Hoare triple {8919#true} assume !(~a~0 < 100000); {8919#true} is VALID [2018-11-18 22:43:48,481 INFO L273 TraceCheckUtils]: 59: Hoare triple {8919#true} havoc ~i~0;~i~0 := 0; {9119#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:48,481 INFO L273 TraceCheckUtils]: 60: Hoare triple {9119#(<= main_~i~0 0)} assume true; {9119#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:48,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {9119#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9119#(<= main_~i~0 0)} is VALID [2018-11-18 22:43:48,482 INFO L273 TraceCheckUtils]: 62: Hoare triple {9119#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9129#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:48,482 INFO L273 TraceCheckUtils]: 63: Hoare triple {9129#(<= main_~i~0 1)} assume true; {9129#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:48,483 INFO L273 TraceCheckUtils]: 64: Hoare triple {9129#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9129#(<= main_~i~0 1)} is VALID [2018-11-18 22:43:48,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {9129#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9139#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:48,484 INFO L273 TraceCheckUtils]: 66: Hoare triple {9139#(<= main_~i~0 2)} assume true; {9139#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:48,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {9139#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9139#(<= main_~i~0 2)} is VALID [2018-11-18 22:43:48,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {9139#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9149#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:48,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {9149#(<= main_~i~0 3)} assume true; {9149#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:48,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {9149#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9149#(<= main_~i~0 3)} is VALID [2018-11-18 22:43:48,486 INFO L273 TraceCheckUtils]: 71: Hoare triple {9149#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9159#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:48,487 INFO L273 TraceCheckUtils]: 72: Hoare triple {9159#(<= main_~i~0 4)} assume true; {9159#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:48,487 INFO L273 TraceCheckUtils]: 73: Hoare triple {9159#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9159#(<= main_~i~0 4)} is VALID [2018-11-18 22:43:48,488 INFO L273 TraceCheckUtils]: 74: Hoare triple {9159#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9169#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:48,488 INFO L273 TraceCheckUtils]: 75: Hoare triple {9169#(<= main_~i~0 5)} assume true; {9169#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:48,489 INFO L273 TraceCheckUtils]: 76: Hoare triple {9169#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9169#(<= main_~i~0 5)} is VALID [2018-11-18 22:43:48,490 INFO L273 TraceCheckUtils]: 77: Hoare triple {9169#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9179#(<= main_~i~0 6)} is VALID [2018-11-18 22:43:48,490 INFO L273 TraceCheckUtils]: 78: Hoare triple {9179#(<= main_~i~0 6)} assume true; {9179#(<= main_~i~0 6)} is VALID [2018-11-18 22:43:48,491 INFO L273 TraceCheckUtils]: 79: Hoare triple {9179#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9179#(<= main_~i~0 6)} is VALID [2018-11-18 22:43:48,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {9179#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9189#(<= main_~i~0 7)} is VALID [2018-11-18 22:43:48,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {9189#(<= main_~i~0 7)} assume true; {9189#(<= main_~i~0 7)} is VALID [2018-11-18 22:43:48,493 INFO L273 TraceCheckUtils]: 82: Hoare triple {9189#(<= main_~i~0 7)} assume !(~i~0 < 100000); {8920#false} is VALID [2018-11-18 22:43:48,493 INFO L273 TraceCheckUtils]: 83: Hoare triple {8920#false} havoc ~x~0;~x~0 := 0; {8920#false} is VALID [2018-11-18 22:43:48,493 INFO L273 TraceCheckUtils]: 84: Hoare triple {8920#false} assume true; {8920#false} is VALID [2018-11-18 22:43:48,493 INFO L273 TraceCheckUtils]: 85: Hoare triple {8920#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8920#false} is VALID [2018-11-18 22:43:48,494 INFO L256 TraceCheckUtils]: 86: Hoare triple {8920#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8920#false} is VALID [2018-11-18 22:43:48,494 INFO L273 TraceCheckUtils]: 87: Hoare triple {8920#false} ~cond := #in~cond; {8920#false} is VALID [2018-11-18 22:43:48,494 INFO L273 TraceCheckUtils]: 88: Hoare triple {8920#false} assume 0 == ~cond; {8920#false} is VALID [2018-11-18 22:43:48,494 INFO L273 TraceCheckUtils]: 89: Hoare triple {8920#false} assume !false; {8920#false} is VALID [2018-11-18 22:43:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-18 22:43:48,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:43:48,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 28 [2018-11-18 22:43:48,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2018-11-18 22:43:48,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:43:48,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:43:48,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:43:48,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:43:48,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:43:48,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:43:48,658 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 28 states. [2018-11-18 22:43:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:49,360 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-11-18 22:43:49,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:43:49,360 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2018-11-18 22:43:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:43:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:43:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 124 transitions. [2018-11-18 22:43:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:43:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 124 transitions. [2018-11-18 22:43:49,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 124 transitions. [2018-11-18 22:43:49,580 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-18 22:43:49,582 INFO L225 Difference]: With dead ends: 139 [2018-11-18 22:43:49,582 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 22:43:49,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:43:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 22:43:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-18 22:43:49,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:43:49,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-18 22:43:49,620 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-18 22:43:49,620 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-18 22:43:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:49,622 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-18 22:43:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:43:49,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:49,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:49,622 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-18 22:43:49,622 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-18 22:43:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:43:49,624 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-11-18 22:43:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-11-18 22:43:49,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:43:49,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:43:49,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:43:49,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:43:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 22:43:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-11-18 22:43:49,626 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 90 [2018-11-18 22:43:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:43:49,626 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-18 22:43:49,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:43:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-18 22:43:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 22:43:49,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:43:49,627 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:43:49,627 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:43:49,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:43:49,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1589682582, now seen corresponding path program 18 times [2018-11-18 22:43:49,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:43:49,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:43:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:49,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:43:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:43:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:43:50,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {9743#true} call ULTIMATE.init(); {9743#true} is VALID [2018-11-18 22:43:50,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {9743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9743#true} is VALID [2018-11-18 22:43:50,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:43:50,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9743#true} {9743#true} #66#return; {9743#true} is VALID [2018-11-18 22:43:50,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {9743#true} call #t~ret8 := main(); {9743#true} is VALID [2018-11-18 22:43:50,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {9743#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9745#(= main_~a~0 0)} is VALID [2018-11-18 22:43:50,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {9745#(= main_~a~0 0)} assume true; {9745#(= main_~a~0 0)} is VALID [2018-11-18 22:43:50,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {9745#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9745#(= main_~a~0 0)} is VALID [2018-11-18 22:43:50,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {9745#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9746#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:50,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {9746#(<= main_~a~0 1)} assume true; {9746#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:50,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {9746#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9746#(<= main_~a~0 1)} is VALID [2018-11-18 22:43:50,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {9746#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9747#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:50,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {9747#(<= main_~a~0 2)} assume true; {9747#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:50,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {9747#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9747#(<= main_~a~0 2)} is VALID [2018-11-18 22:43:50,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {9747#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9748#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:50,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {9748#(<= main_~a~0 3)} assume true; {9748#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:50,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {9748#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9748#(<= main_~a~0 3)} is VALID [2018-11-18 22:43:50,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {9748#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9749#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:50,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {9749#(<= main_~a~0 4)} assume true; {9749#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:50,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {9749#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9749#(<= main_~a~0 4)} is VALID [2018-11-18 22:43:50,062 INFO L273 TraceCheckUtils]: 20: Hoare triple {9749#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9750#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:50,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {9750#(<= main_~a~0 5)} assume true; {9750#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:50,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {9750#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9750#(<= main_~a~0 5)} is VALID [2018-11-18 22:43:50,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {9750#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9751#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:50,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {9751#(<= main_~a~0 6)} assume true; {9751#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:50,065 INFO L273 TraceCheckUtils]: 25: Hoare triple {9751#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9751#(<= main_~a~0 6)} is VALID [2018-11-18 22:43:50,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {9751#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9752#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:50,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {9752#(<= main_~a~0 7)} assume true; {9752#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:50,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {9752#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9752#(<= main_~a~0 7)} is VALID [2018-11-18 22:43:50,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {9752#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9753#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:50,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {9753#(<= main_~a~0 8)} assume true; {9753#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:50,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {9753#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9753#(<= main_~a~0 8)} is VALID [2018-11-18 22:43:50,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {9753#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9754#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:50,070 INFO L273 TraceCheckUtils]: 33: Hoare triple {9754#(<= main_~a~0 9)} assume true; {9754#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:50,070 INFO L273 TraceCheckUtils]: 34: Hoare triple {9754#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9754#(<= main_~a~0 9)} is VALID [2018-11-18 22:43:50,071 INFO L273 TraceCheckUtils]: 35: Hoare triple {9754#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9755#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:50,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {9755#(<= main_~a~0 10)} assume true; {9755#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:50,072 INFO L273 TraceCheckUtils]: 37: Hoare triple {9755#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9755#(<= main_~a~0 10)} is VALID [2018-11-18 22:43:50,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {9755#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9756#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:50,073 INFO L273 TraceCheckUtils]: 39: Hoare triple {9756#(<= main_~a~0 11)} assume true; {9756#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:50,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {9756#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9756#(<= main_~a~0 11)} is VALID [2018-11-18 22:43:50,075 INFO L273 TraceCheckUtils]: 41: Hoare triple {9756#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9757#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:50,075 INFO L273 TraceCheckUtils]: 42: Hoare triple {9757#(<= main_~a~0 12)} assume true; {9757#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:50,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {9757#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9757#(<= main_~a~0 12)} is VALID [2018-11-18 22:43:50,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {9757#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9758#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:50,077 INFO L273 TraceCheckUtils]: 45: Hoare triple {9758#(<= main_~a~0 13)} assume true; {9758#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:50,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {9758#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9758#(<= main_~a~0 13)} is VALID [2018-11-18 22:43:50,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {9758#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9759#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:50,079 INFO L273 TraceCheckUtils]: 48: Hoare triple {9759#(<= main_~a~0 14)} assume true; {9759#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:50,079 INFO L273 TraceCheckUtils]: 49: Hoare triple {9759#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9759#(<= main_~a~0 14)} is VALID [2018-11-18 22:43:50,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {9759#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9760#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:50,081 INFO L273 TraceCheckUtils]: 51: Hoare triple {9760#(<= main_~a~0 15)} assume true; {9760#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:50,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {9760#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9760#(<= main_~a~0 15)} is VALID [2018-11-18 22:43:50,082 INFO L273 TraceCheckUtils]: 53: Hoare triple {9760#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9761#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:50,082 INFO L273 TraceCheckUtils]: 54: Hoare triple {9761#(<= main_~a~0 16)} assume true; {9761#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:50,083 INFO L273 TraceCheckUtils]: 55: Hoare triple {9761#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9761#(<= main_~a~0 16)} is VALID [2018-11-18 22:43:50,084 INFO L273 TraceCheckUtils]: 56: Hoare triple {9761#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9762#(<= main_~a~0 17)} is VALID [2018-11-18 22:43:50,084 INFO L273 TraceCheckUtils]: 57: Hoare triple {9762#(<= main_~a~0 17)} assume true; {9762#(<= main_~a~0 17)} is VALID [2018-11-18 22:43:50,085 INFO L273 TraceCheckUtils]: 58: Hoare triple {9762#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9762#(<= main_~a~0 17)} is VALID [2018-11-18 22:43:50,086 INFO L273 TraceCheckUtils]: 59: Hoare triple {9762#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9763#(<= main_~a~0 18)} is VALID [2018-11-18 22:43:50,086 INFO L273 TraceCheckUtils]: 60: Hoare triple {9763#(<= main_~a~0 18)} assume true; {9763#(<= main_~a~0 18)} is VALID [2018-11-18 22:43:50,087 INFO L273 TraceCheckUtils]: 61: Hoare triple {9763#(<= main_~a~0 18)} assume !(~a~0 < 100000); {9744#false} is VALID [2018-11-18 22:43:50,087 INFO L273 TraceCheckUtils]: 62: Hoare triple {9744#false} havoc ~i~0;~i~0 := 0; {9744#false} is VALID [2018-11-18 22:43:50,087 INFO L273 TraceCheckUtils]: 63: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,087 INFO L273 TraceCheckUtils]: 64: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,088 INFO L273 TraceCheckUtils]: 65: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,088 INFO L273 TraceCheckUtils]: 66: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,088 INFO L273 TraceCheckUtils]: 67: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,088 INFO L273 TraceCheckUtils]: 68: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,088 INFO L273 TraceCheckUtils]: 69: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,088 INFO L273 TraceCheckUtils]: 70: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 71: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 72: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 73: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 74: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 75: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 76: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 77: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 78: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,089 INFO L273 TraceCheckUtils]: 79: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 80: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 81: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 82: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 83: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 84: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 85: Hoare triple {9744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 86: Hoare triple {9744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 87: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,090 INFO L273 TraceCheckUtils]: 88: Hoare triple {9744#false} assume !(~i~0 < 100000); {9744#false} is VALID [2018-11-18 22:43:50,091 INFO L273 TraceCheckUtils]: 89: Hoare triple {9744#false} havoc ~x~0;~x~0 := 0; {9744#false} is VALID [2018-11-18 22:43:50,091 INFO L273 TraceCheckUtils]: 90: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:43:50,091 INFO L273 TraceCheckUtils]: 91: Hoare triple {9744#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9744#false} is VALID [2018-11-18 22:43:50,091 INFO L256 TraceCheckUtils]: 92: Hoare triple {9744#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9744#false} is VALID [2018-11-18 22:43:50,091 INFO L273 TraceCheckUtils]: 93: Hoare triple {9744#false} ~cond := #in~cond; {9744#false} is VALID [2018-11-18 22:43:50,091 INFO L273 TraceCheckUtils]: 94: Hoare triple {9744#false} assume 0 == ~cond; {9744#false} is VALID [2018-11-18 22:43:50,091 INFO L273 TraceCheckUtils]: 95: Hoare triple {9744#false} assume !false; {9744#false} is VALID [2018-11-18 22:43:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 22:43:50,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:43:50,097 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-18 22:43:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:44:13,545 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-18 22:44:13,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:13,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:13,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {9743#true} call ULTIMATE.init(); {9743#true} is VALID [2018-11-18 22:44:13,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {9743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9743#true} is VALID [2018-11-18 22:44:13,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9743#true} {9743#true} #66#return; {9743#true} is VALID [2018-11-18 22:44:13,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {9743#true} call #t~ret8 := main(); {9743#true} is VALID [2018-11-18 22:44:13,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {9743#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9743#true} is VALID [2018-11-18 22:44:13,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 26: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 27: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 28: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 29: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 32: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 35: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 37: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 41: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 46: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 48: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 49: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 50: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,911 INFO L273 TraceCheckUtils]: 51: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 54: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 55: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 56: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 57: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 58: Hoare triple {9743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 59: Hoare triple {9743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9743#true} is VALID [2018-11-18 22:44:13,912 INFO L273 TraceCheckUtils]: 60: Hoare triple {9743#true} assume true; {9743#true} is VALID [2018-11-18 22:44:13,913 INFO L273 TraceCheckUtils]: 61: Hoare triple {9743#true} assume !(~a~0 < 100000); {9743#true} is VALID [2018-11-18 22:44:13,913 INFO L273 TraceCheckUtils]: 62: Hoare triple {9743#true} havoc ~i~0;~i~0 := 0; {9953#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:13,913 INFO L273 TraceCheckUtils]: 63: Hoare triple {9953#(<= main_~i~0 0)} assume true; {9953#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:13,914 INFO L273 TraceCheckUtils]: 64: Hoare triple {9953#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9953#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:13,914 INFO L273 TraceCheckUtils]: 65: Hoare triple {9953#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9963#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:13,914 INFO L273 TraceCheckUtils]: 66: Hoare triple {9963#(<= main_~i~0 1)} assume true; {9963#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:13,915 INFO L273 TraceCheckUtils]: 67: Hoare triple {9963#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9963#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:13,915 INFO L273 TraceCheckUtils]: 68: Hoare triple {9963#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9973#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:13,915 INFO L273 TraceCheckUtils]: 69: Hoare triple {9973#(<= main_~i~0 2)} assume true; {9973#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:13,916 INFO L273 TraceCheckUtils]: 70: Hoare triple {9973#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9973#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:13,916 INFO L273 TraceCheckUtils]: 71: Hoare triple {9973#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9983#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:13,917 INFO L273 TraceCheckUtils]: 72: Hoare triple {9983#(<= main_~i~0 3)} assume true; {9983#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:13,917 INFO L273 TraceCheckUtils]: 73: Hoare triple {9983#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9983#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:13,918 INFO L273 TraceCheckUtils]: 74: Hoare triple {9983#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9993#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:13,918 INFO L273 TraceCheckUtils]: 75: Hoare triple {9993#(<= main_~i~0 4)} assume true; {9993#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:13,919 INFO L273 TraceCheckUtils]: 76: Hoare triple {9993#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9993#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:13,920 INFO L273 TraceCheckUtils]: 77: Hoare triple {9993#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10003#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:13,920 INFO L273 TraceCheckUtils]: 78: Hoare triple {10003#(<= main_~i~0 5)} assume true; {10003#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:13,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {10003#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10003#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:13,921 INFO L273 TraceCheckUtils]: 80: Hoare triple {10003#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10013#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:13,922 INFO L273 TraceCheckUtils]: 81: Hoare triple {10013#(<= main_~i~0 6)} assume true; {10013#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:13,923 INFO L273 TraceCheckUtils]: 82: Hoare triple {10013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10013#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:13,923 INFO L273 TraceCheckUtils]: 83: Hoare triple {10013#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10023#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:13,924 INFO L273 TraceCheckUtils]: 84: Hoare triple {10023#(<= main_~i~0 7)} assume true; {10023#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:13,924 INFO L273 TraceCheckUtils]: 85: Hoare triple {10023#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10023#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:13,925 INFO L273 TraceCheckUtils]: 86: Hoare triple {10023#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10033#(<= main_~i~0 8)} is VALID [2018-11-18 22:44:13,926 INFO L273 TraceCheckUtils]: 87: Hoare triple {10033#(<= main_~i~0 8)} assume true; {10033#(<= main_~i~0 8)} is VALID [2018-11-18 22:44:13,926 INFO L273 TraceCheckUtils]: 88: Hoare triple {10033#(<= main_~i~0 8)} assume !(~i~0 < 100000); {9744#false} is VALID [2018-11-18 22:44:13,926 INFO L273 TraceCheckUtils]: 89: Hoare triple {9744#false} havoc ~x~0;~x~0 := 0; {9744#false} is VALID [2018-11-18 22:44:13,927 INFO L273 TraceCheckUtils]: 90: Hoare triple {9744#false} assume true; {9744#false} is VALID [2018-11-18 22:44:13,927 INFO L273 TraceCheckUtils]: 91: Hoare triple {9744#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9744#false} is VALID [2018-11-18 22:44:13,927 INFO L256 TraceCheckUtils]: 92: Hoare triple {9744#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9744#false} is VALID [2018-11-18 22:44:13,927 INFO L273 TraceCheckUtils]: 93: Hoare triple {9744#false} ~cond := #in~cond; {9744#false} is VALID [2018-11-18 22:44:13,927 INFO L273 TraceCheckUtils]: 94: Hoare triple {9744#false} assume 0 == ~cond; {9744#false} is VALID [2018-11-18 22:44:13,928 INFO L273 TraceCheckUtils]: 95: Hoare triple {9744#false} assume !false; {9744#false} is VALID [2018-11-18 22:44:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-18 22:44:13,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:13,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2018-11-18 22:44:13,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2018-11-18 22:44:13,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:13,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:44:14,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:14,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:44:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:44:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:44:14,065 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 30 states. [2018-11-18 22:44:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:15,092 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-11-18 22:44:15,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:44:15,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2018-11-18 22:44:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:44:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 130 transitions. [2018-11-18 22:44:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:44:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 130 transitions. [2018-11-18 22:44:15,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 130 transitions. [2018-11-18 22:44:15,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:15,223 INFO L225 Difference]: With dead ends: 148 [2018-11-18 22:44:15,223 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 22:44:15,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:44:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 22:44:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-18 22:44:15,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:15,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-18 22:44:15,249 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-18 22:44:15,249 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-18 22:44:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:15,251 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-11-18 22:44:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-11-18 22:44:15,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:15,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:15,252 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-18 22:44:15,252 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-18 22:44:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:15,254 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-11-18 22:44:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-11-18 22:44:15,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:15,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:15,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:15,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 22:44:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-11-18 22:44:15,256 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 96 [2018-11-18 22:44:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:15,257 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-11-18 22:44:15,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:44:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-18 22:44:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 22:44:15,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:15,258 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:15,258 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:15,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -349049913, now seen corresponding path program 19 times [2018-11-18 22:44:15,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:15,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:15,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {10619#true} call ULTIMATE.init(); {10619#true} is VALID [2018-11-18 22:44:15,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {10619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10619#true} is VALID [2018-11-18 22:44:15,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {10619#true} assume true; {10619#true} is VALID [2018-11-18 22:44:15,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10619#true} {10619#true} #66#return; {10619#true} is VALID [2018-11-18 22:44:15,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {10619#true} call #t~ret8 := main(); {10619#true} is VALID [2018-11-18 22:44:15,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {10619#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10621#(= main_~a~0 0)} is VALID [2018-11-18 22:44:15,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {10621#(= main_~a~0 0)} assume true; {10621#(= main_~a~0 0)} is VALID [2018-11-18 22:44:15,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {10621#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10621#(= main_~a~0 0)} is VALID [2018-11-18 22:44:15,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {10621#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10622#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:15,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {10622#(<= main_~a~0 1)} assume true; {10622#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:15,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {10622#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10622#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:15,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {10622#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10623#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:15,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {10623#(<= main_~a~0 2)} assume true; {10623#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:15,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {10623#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10623#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:15,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {10623#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:15,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {10624#(<= main_~a~0 3)} assume true; {10624#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:15,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {10624#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10624#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:15,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {10624#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10625#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:15,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {10625#(<= main_~a~0 4)} assume true; {10625#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:15,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {10625#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10625#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:15,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {10625#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10626#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:15,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {10626#(<= main_~a~0 5)} assume true; {10626#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:15,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {10626#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10626#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:15,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {10626#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10627#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:15,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {10627#(<= main_~a~0 6)} assume true; {10627#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:15,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {10627#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10627#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:15,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {10627#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10628#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:15,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {10628#(<= main_~a~0 7)} assume true; {10628#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:15,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {10628#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10628#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:15,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {10628#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10629#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:15,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {10629#(<= main_~a~0 8)} assume true; {10629#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:15,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {10629#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10629#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:15,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {10629#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10630#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:15,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {10630#(<= main_~a~0 9)} assume true; {10630#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:15,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {10630#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10630#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:15,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {10630#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10631#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:15,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {10631#(<= main_~a~0 10)} assume true; {10631#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:15,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {10631#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10631#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:15,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {10631#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10632#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:15,947 INFO L273 TraceCheckUtils]: 39: Hoare triple {10632#(<= main_~a~0 11)} assume true; {10632#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:15,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {10632#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10632#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:15,949 INFO L273 TraceCheckUtils]: 41: Hoare triple {10632#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10633#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:15,949 INFO L273 TraceCheckUtils]: 42: Hoare triple {10633#(<= main_~a~0 12)} assume true; {10633#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:15,950 INFO L273 TraceCheckUtils]: 43: Hoare triple {10633#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10633#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:15,950 INFO L273 TraceCheckUtils]: 44: Hoare triple {10633#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10634#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:15,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {10634#(<= main_~a~0 13)} assume true; {10634#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:15,951 INFO L273 TraceCheckUtils]: 46: Hoare triple {10634#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10634#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:15,952 INFO L273 TraceCheckUtils]: 47: Hoare triple {10634#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10635#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:15,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {10635#(<= main_~a~0 14)} assume true; {10635#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:15,953 INFO L273 TraceCheckUtils]: 49: Hoare triple {10635#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10635#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:15,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {10635#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10636#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:15,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {10636#(<= main_~a~0 15)} assume true; {10636#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:15,955 INFO L273 TraceCheckUtils]: 52: Hoare triple {10636#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10636#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:15,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {10636#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10637#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:15,956 INFO L273 TraceCheckUtils]: 54: Hoare triple {10637#(<= main_~a~0 16)} assume true; {10637#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:15,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {10637#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10637#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:15,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {10637#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10638#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:15,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {10638#(<= main_~a~0 17)} assume true; {10638#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:15,959 INFO L273 TraceCheckUtils]: 58: Hoare triple {10638#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10638#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:15,959 INFO L273 TraceCheckUtils]: 59: Hoare triple {10638#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10639#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:15,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {10639#(<= main_~a~0 18)} assume true; {10639#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:15,960 INFO L273 TraceCheckUtils]: 61: Hoare triple {10639#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10639#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:15,961 INFO L273 TraceCheckUtils]: 62: Hoare triple {10639#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10640#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:15,962 INFO L273 TraceCheckUtils]: 63: Hoare triple {10640#(<= main_~a~0 19)} assume true; {10640#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:15,962 INFO L273 TraceCheckUtils]: 64: Hoare triple {10640#(<= main_~a~0 19)} assume !(~a~0 < 100000); {10620#false} is VALID [2018-11-18 22:44:15,963 INFO L273 TraceCheckUtils]: 65: Hoare triple {10620#false} havoc ~i~0;~i~0 := 0; {10620#false} is VALID [2018-11-18 22:44:15,963 INFO L273 TraceCheckUtils]: 66: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,963 INFO L273 TraceCheckUtils]: 67: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,963 INFO L273 TraceCheckUtils]: 68: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,963 INFO L273 TraceCheckUtils]: 69: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,964 INFO L273 TraceCheckUtils]: 70: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,964 INFO L273 TraceCheckUtils]: 71: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,964 INFO L273 TraceCheckUtils]: 72: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,964 INFO L273 TraceCheckUtils]: 73: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,964 INFO L273 TraceCheckUtils]: 74: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,965 INFO L273 TraceCheckUtils]: 75: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,965 INFO L273 TraceCheckUtils]: 76: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,965 INFO L273 TraceCheckUtils]: 77: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,965 INFO L273 TraceCheckUtils]: 78: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,965 INFO L273 TraceCheckUtils]: 79: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,965 INFO L273 TraceCheckUtils]: 80: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 81: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 82: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 83: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 84: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 85: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 86: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 88: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,966 INFO L273 TraceCheckUtils]: 89: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 90: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 91: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 92: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 93: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 94: Hoare triple {10620#false} assume !(~i~0 < 100000); {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 95: Hoare triple {10620#false} havoc ~x~0;~x~0 := 0; {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 96: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L273 TraceCheckUtils]: 97: Hoare triple {10620#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {10620#false} is VALID [2018-11-18 22:44:15,967 INFO L256 TraceCheckUtils]: 98: Hoare triple {10620#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10620#false} is VALID [2018-11-18 22:44:15,968 INFO L273 TraceCheckUtils]: 99: Hoare triple {10620#false} ~cond := #in~cond; {10620#false} is VALID [2018-11-18 22:44:15,968 INFO L273 TraceCheckUtils]: 100: Hoare triple {10620#false} assume 0 == ~cond; {10620#false} is VALID [2018-11-18 22:44:15,968 INFO L273 TraceCheckUtils]: 101: Hoare triple {10620#false} assume !false; {10620#false} is VALID [2018-11-18 22:44:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:44:15,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:15,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:15,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:16,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:16,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {10619#true} call ULTIMATE.init(); {10619#true} is VALID [2018-11-18 22:44:16,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {10619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10619#true} is VALID [2018-11-18 22:44:16,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {10619#true} assume true; {10619#true} is VALID [2018-11-18 22:44:16,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10619#true} {10619#true} #66#return; {10619#true} is VALID [2018-11-18 22:44:16,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {10619#true} call #t~ret8 := main(); {10619#true} is VALID [2018-11-18 22:44:16,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {10619#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10659#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:16,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {10659#(<= main_~a~0 0)} assume true; {10659#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:16,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {10659#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10659#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:16,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {10659#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10622#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:16,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {10622#(<= main_~a~0 1)} assume true; {10622#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:16,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {10622#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10622#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:16,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {10622#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10623#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:16,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {10623#(<= main_~a~0 2)} assume true; {10623#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:16,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {10623#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10623#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:16,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {10623#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10624#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:16,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {10624#(<= main_~a~0 3)} assume true; {10624#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:16,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {10624#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10624#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:16,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {10624#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10625#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:16,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {10625#(<= main_~a~0 4)} assume true; {10625#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:16,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {10625#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10625#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:16,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {10625#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10626#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:16,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {10626#(<= main_~a~0 5)} assume true; {10626#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:16,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {10626#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10626#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:16,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {10626#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10627#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:16,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {10627#(<= main_~a~0 6)} assume true; {10627#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:16,293 INFO L273 TraceCheckUtils]: 25: Hoare triple {10627#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10627#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:16,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {10627#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10628#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:16,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {10628#(<= main_~a~0 7)} assume true; {10628#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:16,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {10628#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10628#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:16,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {10628#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10629#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:16,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {10629#(<= main_~a~0 8)} assume true; {10629#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:16,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {10629#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10629#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:16,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {10629#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10630#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:16,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {10630#(<= main_~a~0 9)} assume true; {10630#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:16,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {10630#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10630#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:16,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {10630#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10631#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:16,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {10631#(<= main_~a~0 10)} assume true; {10631#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:16,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {10631#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10631#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:16,301 INFO L273 TraceCheckUtils]: 38: Hoare triple {10631#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10632#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:16,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {10632#(<= main_~a~0 11)} assume true; {10632#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:16,302 INFO L273 TraceCheckUtils]: 40: Hoare triple {10632#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10632#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:16,302 INFO L273 TraceCheckUtils]: 41: Hoare triple {10632#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10633#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:16,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {10633#(<= main_~a~0 12)} assume true; {10633#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:16,303 INFO L273 TraceCheckUtils]: 43: Hoare triple {10633#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10633#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:16,304 INFO L273 TraceCheckUtils]: 44: Hoare triple {10633#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10634#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:16,305 INFO L273 TraceCheckUtils]: 45: Hoare triple {10634#(<= main_~a~0 13)} assume true; {10634#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:16,305 INFO L273 TraceCheckUtils]: 46: Hoare triple {10634#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10634#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:16,306 INFO L273 TraceCheckUtils]: 47: Hoare triple {10634#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10635#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:16,307 INFO L273 TraceCheckUtils]: 48: Hoare triple {10635#(<= main_~a~0 14)} assume true; {10635#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:16,307 INFO L273 TraceCheckUtils]: 49: Hoare triple {10635#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10635#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:16,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {10635#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10636#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:16,308 INFO L273 TraceCheckUtils]: 51: Hoare triple {10636#(<= main_~a~0 15)} assume true; {10636#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:16,309 INFO L273 TraceCheckUtils]: 52: Hoare triple {10636#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10636#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:16,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {10636#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10637#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:16,310 INFO L273 TraceCheckUtils]: 54: Hoare triple {10637#(<= main_~a~0 16)} assume true; {10637#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:16,311 INFO L273 TraceCheckUtils]: 55: Hoare triple {10637#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10637#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:16,311 INFO L273 TraceCheckUtils]: 56: Hoare triple {10637#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10638#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:16,312 INFO L273 TraceCheckUtils]: 57: Hoare triple {10638#(<= main_~a~0 17)} assume true; {10638#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:16,312 INFO L273 TraceCheckUtils]: 58: Hoare triple {10638#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10638#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:16,313 INFO L273 TraceCheckUtils]: 59: Hoare triple {10638#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10639#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:16,314 INFO L273 TraceCheckUtils]: 60: Hoare triple {10639#(<= main_~a~0 18)} assume true; {10639#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:16,314 INFO L273 TraceCheckUtils]: 61: Hoare triple {10639#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10639#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:16,315 INFO L273 TraceCheckUtils]: 62: Hoare triple {10639#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10640#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:16,315 INFO L273 TraceCheckUtils]: 63: Hoare triple {10640#(<= main_~a~0 19)} assume true; {10640#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:16,316 INFO L273 TraceCheckUtils]: 64: Hoare triple {10640#(<= main_~a~0 19)} assume !(~a~0 < 100000); {10620#false} is VALID [2018-11-18 22:44:16,316 INFO L273 TraceCheckUtils]: 65: Hoare triple {10620#false} havoc ~i~0;~i~0 := 0; {10620#false} is VALID [2018-11-18 22:44:16,317 INFO L273 TraceCheckUtils]: 66: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,317 INFO L273 TraceCheckUtils]: 67: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,317 INFO L273 TraceCheckUtils]: 68: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,317 INFO L273 TraceCheckUtils]: 69: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,317 INFO L273 TraceCheckUtils]: 70: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,318 INFO L273 TraceCheckUtils]: 72: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,318 INFO L273 TraceCheckUtils]: 73: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,318 INFO L273 TraceCheckUtils]: 74: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,318 INFO L273 TraceCheckUtils]: 75: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,318 INFO L273 TraceCheckUtils]: 76: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,319 INFO L273 TraceCheckUtils]: 77: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,319 INFO L273 TraceCheckUtils]: 78: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,319 INFO L273 TraceCheckUtils]: 79: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,319 INFO L273 TraceCheckUtils]: 80: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,319 INFO L273 TraceCheckUtils]: 81: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,319 INFO L273 TraceCheckUtils]: 82: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,319 INFO L273 TraceCheckUtils]: 83: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 84: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 85: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 86: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 88: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 89: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 90: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 91: Hoare triple {10620#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10620#false} is VALID [2018-11-18 22:44:16,320 INFO L273 TraceCheckUtils]: 92: Hoare triple {10620#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 93: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 94: Hoare triple {10620#false} assume !(~i~0 < 100000); {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 95: Hoare triple {10620#false} havoc ~x~0;~x~0 := 0; {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 96: Hoare triple {10620#false} assume true; {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 97: Hoare triple {10620#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L256 TraceCheckUtils]: 98: Hoare triple {10620#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 99: Hoare triple {10620#false} ~cond := #in~cond; {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 100: Hoare triple {10620#false} assume 0 == ~cond; {10620#false} is VALID [2018-11-18 22:44:16,321 INFO L273 TraceCheckUtils]: 101: Hoare triple {10620#false} assume !false; {10620#false} is VALID [2018-11-18 22:44:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:44:16,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:16,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 22:44:16,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-11-18 22:44:16,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:16,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:44:16,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:16,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:44:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:44:16,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:44:16,429 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 23 states. [2018-11-18 22:44:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:16,997 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-18 22:44:16,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:44:16,997 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-11-18 22:44:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:44:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-18 22:44:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:44:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2018-11-18 22:44:16,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2018-11-18 22:44:17,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:17,105 INFO L225 Difference]: With dead ends: 153 [2018-11-18 22:44:17,105 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 22:44:17,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:44:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 22:44:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-18 22:44:17,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:17,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 110 states. [2018-11-18 22:44:17,137 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 110 states. [2018-11-18 22:44:17,137 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 110 states. [2018-11-18 22:44:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:17,139 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-18 22:44:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:44:17,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:17,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:17,140 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 111 states. [2018-11-18 22:44:17,140 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 111 states. [2018-11-18 22:44:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:17,142 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-18 22:44:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-18 22:44:17,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:17,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:17,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:17,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 22:44:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-11-18 22:44:17,144 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 102 [2018-11-18 22:44:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:17,144 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-11-18 22:44:17,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:44:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-18 22:44:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 22:44:17,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:17,146 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:17,146 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:17,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash 791872684, now seen corresponding path program 20 times [2018-11-18 22:44:17,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:17,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:17,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:17,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:44:17,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:17,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {11521#true} call ULTIMATE.init(); {11521#true} is VALID [2018-11-18 22:44:17,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {11521#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11521#true} is VALID [2018-11-18 22:44:17,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {11521#true} assume true; {11521#true} is VALID [2018-11-18 22:44:17,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11521#true} {11521#true} #66#return; {11521#true} is VALID [2018-11-18 22:44:17,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {11521#true} call #t~ret8 := main(); {11521#true} is VALID [2018-11-18 22:44:17,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {11521#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11523#(= main_~a~0 0)} is VALID [2018-11-18 22:44:17,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {11523#(= main_~a~0 0)} assume true; {11523#(= main_~a~0 0)} is VALID [2018-11-18 22:44:17,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {11523#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11523#(= main_~a~0 0)} is VALID [2018-11-18 22:44:17,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {11523#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11524#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:17,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {11524#(<= main_~a~0 1)} assume true; {11524#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:17,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {11524#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11524#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:17,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {11524#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11525#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:17,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {11525#(<= main_~a~0 2)} assume true; {11525#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:17,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {11525#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11525#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:17,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11526#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:17,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {11526#(<= main_~a~0 3)} assume true; {11526#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:17,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11526#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:17,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11527#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:17,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~a~0 4)} assume true; {11527#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:17,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11527#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:17,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {11527#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11528#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:17,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~a~0 5)} assume true; {11528#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:17,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {11528#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11528#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:17,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {11528#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11529#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:17,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {11529#(<= main_~a~0 6)} assume true; {11529#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:17,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {11529#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11529#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:17,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {11529#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11530#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:17,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {11530#(<= main_~a~0 7)} assume true; {11530#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:17,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {11530#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11530#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:17,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {11530#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11531#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:17,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {11531#(<= main_~a~0 8)} assume true; {11531#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:17,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {11531#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11531#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:17,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {11531#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11532#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:17,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {11532#(<= main_~a~0 9)} assume true; {11532#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:17,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {11532#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11532#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:17,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {11532#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11533#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:17,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {11533#(<= main_~a~0 10)} assume true; {11533#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:17,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {11533#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11533#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:17,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {11533#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11534#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:17,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {11534#(<= main_~a~0 11)} assume true; {11534#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:17,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {11534#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11534#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:17,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {11534#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11535#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:17,539 INFO L273 TraceCheckUtils]: 42: Hoare triple {11535#(<= main_~a~0 12)} assume true; {11535#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:17,539 INFO L273 TraceCheckUtils]: 43: Hoare triple {11535#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11535#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:17,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {11535#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11536#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:17,540 INFO L273 TraceCheckUtils]: 45: Hoare triple {11536#(<= main_~a~0 13)} assume true; {11536#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:17,541 INFO L273 TraceCheckUtils]: 46: Hoare triple {11536#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11536#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:17,541 INFO L273 TraceCheckUtils]: 47: Hoare triple {11536#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11537#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:17,542 INFO L273 TraceCheckUtils]: 48: Hoare triple {11537#(<= main_~a~0 14)} assume true; {11537#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:17,542 INFO L273 TraceCheckUtils]: 49: Hoare triple {11537#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11537#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:17,543 INFO L273 TraceCheckUtils]: 50: Hoare triple {11537#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11538#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:17,544 INFO L273 TraceCheckUtils]: 51: Hoare triple {11538#(<= main_~a~0 15)} assume true; {11538#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:17,544 INFO L273 TraceCheckUtils]: 52: Hoare triple {11538#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11538#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:17,545 INFO L273 TraceCheckUtils]: 53: Hoare triple {11538#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11539#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:17,545 INFO L273 TraceCheckUtils]: 54: Hoare triple {11539#(<= main_~a~0 16)} assume true; {11539#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:17,546 INFO L273 TraceCheckUtils]: 55: Hoare triple {11539#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11539#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:17,547 INFO L273 TraceCheckUtils]: 56: Hoare triple {11539#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11540#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:17,547 INFO L273 TraceCheckUtils]: 57: Hoare triple {11540#(<= main_~a~0 17)} assume true; {11540#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:17,548 INFO L273 TraceCheckUtils]: 58: Hoare triple {11540#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11540#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:17,548 INFO L273 TraceCheckUtils]: 59: Hoare triple {11540#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11541#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:17,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {11541#(<= main_~a~0 18)} assume true; {11541#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:17,549 INFO L273 TraceCheckUtils]: 61: Hoare triple {11541#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11541#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:17,550 INFO L273 TraceCheckUtils]: 62: Hoare triple {11541#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11542#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:17,550 INFO L273 TraceCheckUtils]: 63: Hoare triple {11542#(<= main_~a~0 19)} assume true; {11542#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:17,551 INFO L273 TraceCheckUtils]: 64: Hoare triple {11542#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11542#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:17,552 INFO L273 TraceCheckUtils]: 65: Hoare triple {11542#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11543#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:17,552 INFO L273 TraceCheckUtils]: 66: Hoare triple {11543#(<= main_~a~0 20)} assume true; {11543#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:17,553 INFO L273 TraceCheckUtils]: 67: Hoare triple {11543#(<= main_~a~0 20)} assume !(~a~0 < 100000); {11522#false} is VALID [2018-11-18 22:44:17,553 INFO L273 TraceCheckUtils]: 68: Hoare triple {11522#false} havoc ~i~0;~i~0 := 0; {11522#false} is VALID [2018-11-18 22:44:17,553 INFO L273 TraceCheckUtils]: 69: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,553 INFO L273 TraceCheckUtils]: 70: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,553 INFO L273 TraceCheckUtils]: 71: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,554 INFO L273 TraceCheckUtils]: 72: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,554 INFO L273 TraceCheckUtils]: 73: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,554 INFO L273 TraceCheckUtils]: 74: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,554 INFO L273 TraceCheckUtils]: 75: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,554 INFO L273 TraceCheckUtils]: 76: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,555 INFO L273 TraceCheckUtils]: 77: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,555 INFO L273 TraceCheckUtils]: 78: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,555 INFO L273 TraceCheckUtils]: 79: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,555 INFO L273 TraceCheckUtils]: 80: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,555 INFO L273 TraceCheckUtils]: 81: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,555 INFO L273 TraceCheckUtils]: 82: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,555 INFO L273 TraceCheckUtils]: 83: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 84: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 85: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 86: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 87: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 88: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 89: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 91: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,556 INFO L273 TraceCheckUtils]: 92: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 93: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 94: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 95: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 96: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 97: Hoare triple {11522#false} assume !(~i~0 < 100000); {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 98: Hoare triple {11522#false} havoc ~x~0;~x~0 := 0; {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 99: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:17,557 INFO L273 TraceCheckUtils]: 100: Hoare triple {11522#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11522#false} is VALID [2018-11-18 22:44:17,558 INFO L256 TraceCheckUtils]: 101: Hoare triple {11522#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11522#false} is VALID [2018-11-18 22:44:17,558 INFO L273 TraceCheckUtils]: 102: Hoare triple {11522#false} ~cond := #in~cond; {11522#false} is VALID [2018-11-18 22:44:17,558 INFO L273 TraceCheckUtils]: 103: Hoare triple {11522#false} assume 0 == ~cond; {11522#false} is VALID [2018-11-18 22:44:17,558 INFO L273 TraceCheckUtils]: 104: Hoare triple {11522#false} assume !false; {11522#false} is VALID [2018-11-18 22:44:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:44:17,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:17,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:17,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:44:17,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:44:17,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:17,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:18,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {11521#true} call ULTIMATE.init(); {11521#true} is VALID [2018-11-18 22:44:18,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {11521#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11521#true} is VALID [2018-11-18 22:44:18,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {11521#true} assume true; {11521#true} is VALID [2018-11-18 22:44:18,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11521#true} {11521#true} #66#return; {11521#true} is VALID [2018-11-18 22:44:18,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {11521#true} call #t~ret8 := main(); {11521#true} is VALID [2018-11-18 22:44:18,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {11521#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11562#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:18,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {11562#(<= main_~a~0 0)} assume true; {11562#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:18,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {11562#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11562#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:18,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {11562#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11524#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:18,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {11524#(<= main_~a~0 1)} assume true; {11524#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:18,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {11524#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11524#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:18,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {11524#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11525#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:18,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {11525#(<= main_~a~0 2)} assume true; {11525#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:18,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {11525#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11525#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:18,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11526#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:18,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {11526#(<= main_~a~0 3)} assume true; {11526#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:18,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11526#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:18,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11527#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:18,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~a~0 4)} assume true; {11527#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:18,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11527#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:18,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {11527#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11528#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:18,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~a~0 5)} assume true; {11528#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:18,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {11528#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11528#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:18,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {11528#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11529#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:18,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {11529#(<= main_~a~0 6)} assume true; {11529#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:18,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {11529#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11529#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:18,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {11529#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11530#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:18,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {11530#(<= main_~a~0 7)} assume true; {11530#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:18,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {11530#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11530#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:18,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {11530#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11531#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:18,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {11531#(<= main_~a~0 8)} assume true; {11531#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:18,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {11531#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11531#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:18,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {11531#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11532#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:18,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {11532#(<= main_~a~0 9)} assume true; {11532#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:18,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {11532#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11532#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:18,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {11532#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11533#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:18,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {11533#(<= main_~a~0 10)} assume true; {11533#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:18,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {11533#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11533#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:18,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {11533#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11534#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:18,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {11534#(<= main_~a~0 11)} assume true; {11534#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:18,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {11534#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11534#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:18,082 INFO L273 TraceCheckUtils]: 41: Hoare triple {11534#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11535#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:18,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {11535#(<= main_~a~0 12)} assume true; {11535#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:18,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {11535#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11535#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:18,084 INFO L273 TraceCheckUtils]: 44: Hoare triple {11535#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11536#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:18,084 INFO L273 TraceCheckUtils]: 45: Hoare triple {11536#(<= main_~a~0 13)} assume true; {11536#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:18,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {11536#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11536#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:18,085 INFO L273 TraceCheckUtils]: 47: Hoare triple {11536#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11537#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:18,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {11537#(<= main_~a~0 14)} assume true; {11537#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:18,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {11537#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11537#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:18,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {11537#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11538#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:18,088 INFO L273 TraceCheckUtils]: 51: Hoare triple {11538#(<= main_~a~0 15)} assume true; {11538#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:18,088 INFO L273 TraceCheckUtils]: 52: Hoare triple {11538#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11538#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:18,089 INFO L273 TraceCheckUtils]: 53: Hoare triple {11538#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11539#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:18,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {11539#(<= main_~a~0 16)} assume true; {11539#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:18,090 INFO L273 TraceCheckUtils]: 55: Hoare triple {11539#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11539#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:18,090 INFO L273 TraceCheckUtils]: 56: Hoare triple {11539#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11540#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:18,091 INFO L273 TraceCheckUtils]: 57: Hoare triple {11540#(<= main_~a~0 17)} assume true; {11540#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:18,091 INFO L273 TraceCheckUtils]: 58: Hoare triple {11540#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11540#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:18,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {11540#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11541#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:18,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {11541#(<= main_~a~0 18)} assume true; {11541#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:18,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {11541#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11541#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:18,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {11541#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11542#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:18,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {11542#(<= main_~a~0 19)} assume true; {11542#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:18,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {11542#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11542#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:18,096 INFO L273 TraceCheckUtils]: 65: Hoare triple {11542#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11543#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:18,096 INFO L273 TraceCheckUtils]: 66: Hoare triple {11543#(<= main_~a~0 20)} assume true; {11543#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:18,097 INFO L273 TraceCheckUtils]: 67: Hoare triple {11543#(<= main_~a~0 20)} assume !(~a~0 < 100000); {11522#false} is VALID [2018-11-18 22:44:18,097 INFO L273 TraceCheckUtils]: 68: Hoare triple {11522#false} havoc ~i~0;~i~0 := 0; {11522#false} is VALID [2018-11-18 22:44:18,097 INFO L273 TraceCheckUtils]: 69: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,097 INFO L273 TraceCheckUtils]: 70: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,098 INFO L273 TraceCheckUtils]: 71: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,098 INFO L273 TraceCheckUtils]: 72: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,098 INFO L273 TraceCheckUtils]: 73: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,098 INFO L273 TraceCheckUtils]: 74: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,098 INFO L273 TraceCheckUtils]: 75: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,099 INFO L273 TraceCheckUtils]: 76: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,099 INFO L273 TraceCheckUtils]: 77: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,099 INFO L273 TraceCheckUtils]: 78: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,099 INFO L273 TraceCheckUtils]: 79: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,099 INFO L273 TraceCheckUtils]: 80: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,099 INFO L273 TraceCheckUtils]: 81: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 82: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 84: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 85: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 87: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 88: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 89: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 90: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,100 INFO L273 TraceCheckUtils]: 91: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 92: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 93: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 94: Hoare triple {11522#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 95: Hoare triple {11522#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 96: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 97: Hoare triple {11522#false} assume !(~i~0 < 100000); {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 98: Hoare triple {11522#false} havoc ~x~0;~x~0 := 0; {11522#false} is VALID [2018-11-18 22:44:18,101 INFO L273 TraceCheckUtils]: 99: Hoare triple {11522#false} assume true; {11522#false} is VALID [2018-11-18 22:44:18,102 INFO L273 TraceCheckUtils]: 100: Hoare triple {11522#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11522#false} is VALID [2018-11-18 22:44:18,102 INFO L256 TraceCheckUtils]: 101: Hoare triple {11522#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11522#false} is VALID [2018-11-18 22:44:18,102 INFO L273 TraceCheckUtils]: 102: Hoare triple {11522#false} ~cond := #in~cond; {11522#false} is VALID [2018-11-18 22:44:18,102 INFO L273 TraceCheckUtils]: 103: Hoare triple {11522#false} assume 0 == ~cond; {11522#false} is VALID [2018-11-18 22:44:18,102 INFO L273 TraceCheckUtils]: 104: Hoare triple {11522#false} assume !false; {11522#false} is VALID [2018-11-18 22:44:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:44:18,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:18,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 22:44:18,128 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2018-11-18 22:44:18,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:18,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:44:18,207 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-18 22:44:18,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:44:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:44:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:44:18,208 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 24 states. [2018-11-18 22:44:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:18,714 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-18 22:44:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:44:18,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2018-11-18 22:44:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:44:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-18 22:44:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:44:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 108 transitions. [2018-11-18 22:44:18,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 108 transitions. [2018-11-18 22:44:18,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:18,829 INFO L225 Difference]: With dead ends: 156 [2018-11-18 22:44:18,830 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 22:44:18,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:44:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 22:44:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-18 22:44:18,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:18,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 113 states. [2018-11-18 22:44:18,861 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 113 states. [2018-11-18 22:44:18,861 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 113 states. [2018-11-18 22:44:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:18,863 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-18 22:44:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-11-18 22:44:18,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:18,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:18,863 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 114 states. [2018-11-18 22:44:18,863 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 114 states. [2018-11-18 22:44:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:18,865 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-18 22:44:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-11-18 22:44:18,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:18,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:18,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:18,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-18 22:44:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-11-18 22:44:18,868 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 105 [2018-11-18 22:44:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:18,868 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-11-18 22:44:18,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:44:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-11-18 22:44:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 22:44:18,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:18,869 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:18,869 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:18,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash -354220633, now seen corresponding path program 21 times [2018-11-18 22:44:18,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:18,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:20,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {12447#true} call ULTIMATE.init(); {12447#true} is VALID [2018-11-18 22:44:20,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {12447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12447#true} is VALID [2018-11-18 22:44:20,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:20,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12447#true} {12447#true} #66#return; {12447#true} is VALID [2018-11-18 22:44:20,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {12447#true} call #t~ret8 := main(); {12447#true} is VALID [2018-11-18 22:44:20,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {12447#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12449#(= main_~a~0 0)} is VALID [2018-11-18 22:44:20,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {12449#(= main_~a~0 0)} assume true; {12449#(= main_~a~0 0)} is VALID [2018-11-18 22:44:20,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {12449#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12449#(= main_~a~0 0)} is VALID [2018-11-18 22:44:20,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {12449#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12450#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {12450#(<= main_~a~0 1)} assume true; {12450#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {12450#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12450#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:20,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {12450#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12451#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {12451#(<= main_~a~0 2)} assume true; {12451#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {12451#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12451#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:20,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {12451#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12452#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {12452#(<= main_~a~0 3)} assume true; {12452#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {12452#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12452#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:20,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {12452#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12453#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {12453#(<= main_~a~0 4)} assume true; {12453#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {12453#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12453#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:20,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {12453#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12454#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {12454#(<= main_~a~0 5)} assume true; {12454#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {12454#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12454#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:20,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {12454#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12455#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {12455#(<= main_~a~0 6)} assume true; {12455#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {12455#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12455#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:20,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {12455#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12456#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {12456#(<= main_~a~0 7)} assume true; {12456#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {12456#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12456#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:20,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {12456#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12457#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {12457#(<= main_~a~0 8)} assume true; {12457#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {12457#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12457#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:20,344 INFO L273 TraceCheckUtils]: 32: Hoare triple {12457#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12458#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {12458#(<= main_~a~0 9)} assume true; {12458#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,345 INFO L273 TraceCheckUtils]: 34: Hoare triple {12458#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12458#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:20,346 INFO L273 TraceCheckUtils]: 35: Hoare triple {12458#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12459#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {12459#(<= main_~a~0 10)} assume true; {12459#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {12459#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12459#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:20,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {12459#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12460#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {12460#(<= main_~a~0 11)} assume true; {12460#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,349 INFO L273 TraceCheckUtils]: 40: Hoare triple {12460#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12460#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:20,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {12460#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12461#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,350 INFO L273 TraceCheckUtils]: 42: Hoare triple {12461#(<= main_~a~0 12)} assume true; {12461#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {12461#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12461#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:20,351 INFO L273 TraceCheckUtils]: 44: Hoare triple {12461#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12462#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,352 INFO L273 TraceCheckUtils]: 45: Hoare triple {12462#(<= main_~a~0 13)} assume true; {12462#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,353 INFO L273 TraceCheckUtils]: 46: Hoare triple {12462#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12462#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:20,353 INFO L273 TraceCheckUtils]: 47: Hoare triple {12462#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12463#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {12463#(<= main_~a~0 14)} assume true; {12463#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {12463#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12463#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:20,355 INFO L273 TraceCheckUtils]: 50: Hoare triple {12463#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12464#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:20,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {12464#(<= main_~a~0 15)} assume true; {12464#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:20,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {12464#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12464#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:20,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {12464#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12465#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:20,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {12465#(<= main_~a~0 16)} assume true; {12465#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:20,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {12465#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12465#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:20,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {12465#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12466#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:20,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {12466#(<= main_~a~0 17)} assume true; {12466#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:20,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {12466#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12466#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:20,360 INFO L273 TraceCheckUtils]: 59: Hoare triple {12466#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12467#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:20,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {12467#(<= main_~a~0 18)} assume true; {12467#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:20,361 INFO L273 TraceCheckUtils]: 61: Hoare triple {12467#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12467#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:20,362 INFO L273 TraceCheckUtils]: 62: Hoare triple {12467#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12468#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:20,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {12468#(<= main_~a~0 19)} assume true; {12468#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:20,363 INFO L273 TraceCheckUtils]: 64: Hoare triple {12468#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12468#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:20,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {12468#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12469#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:20,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {12469#(<= main_~a~0 20)} assume true; {12469#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:20,365 INFO L273 TraceCheckUtils]: 67: Hoare triple {12469#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12469#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:20,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {12469#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12470#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:20,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {12470#(<= main_~a~0 21)} assume true; {12470#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:20,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {12470#(<= main_~a~0 21)} assume !(~a~0 < 100000); {12448#false} is VALID [2018-11-18 22:44:20,367 INFO L273 TraceCheckUtils]: 71: Hoare triple {12448#false} havoc ~i~0;~i~0 := 0; {12448#false} is VALID [2018-11-18 22:44:20,367 INFO L273 TraceCheckUtils]: 72: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,368 INFO L273 TraceCheckUtils]: 73: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,368 INFO L273 TraceCheckUtils]: 74: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,368 INFO L273 TraceCheckUtils]: 75: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,368 INFO L273 TraceCheckUtils]: 76: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,368 INFO L273 TraceCheckUtils]: 77: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,369 INFO L273 TraceCheckUtils]: 78: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,369 INFO L273 TraceCheckUtils]: 79: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,369 INFO L273 TraceCheckUtils]: 80: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,369 INFO L273 TraceCheckUtils]: 81: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,369 INFO L273 TraceCheckUtils]: 82: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 83: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 84: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 85: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 86: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 87: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 88: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 89: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 90: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,370 INFO L273 TraceCheckUtils]: 91: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 92: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 93: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 94: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 95: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 96: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 97: Hoare triple {12448#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 98: Hoare triple {12448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 99: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,371 INFO L273 TraceCheckUtils]: 100: Hoare triple {12448#false} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-18 22:44:20,372 INFO L273 TraceCheckUtils]: 101: Hoare triple {12448#false} havoc ~x~0;~x~0 := 0; {12448#false} is VALID [2018-11-18 22:44:20,372 INFO L273 TraceCheckUtils]: 102: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:20,372 INFO L273 TraceCheckUtils]: 103: Hoare triple {12448#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {12448#false} is VALID [2018-11-18 22:44:20,372 INFO L256 TraceCheckUtils]: 104: Hoare triple {12448#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12448#false} is VALID [2018-11-18 22:44:20,372 INFO L273 TraceCheckUtils]: 105: Hoare triple {12448#false} ~cond := #in~cond; {12448#false} is VALID [2018-11-18 22:44:20,373 INFO L273 TraceCheckUtils]: 106: Hoare triple {12448#false} assume 0 == ~cond; {12448#false} is VALID [2018-11-18 22:44:20,373 INFO L273 TraceCheckUtils]: 107: Hoare triple {12448#false} assume !false; {12448#false} is VALID [2018-11-18 22:44:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 22:44:20,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:20,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:20,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:44:21,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:44:21,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:21,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:21,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {12447#true} call ULTIMATE.init(); {12447#true} is VALID [2018-11-18 22:44:21,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {12447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12447#true} is VALID [2018-11-18 22:44:21,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12447#true} {12447#true} #66#return; {12447#true} is VALID [2018-11-18 22:44:21,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {12447#true} call #t~ret8 := main(); {12447#true} is VALID [2018-11-18 22:44:21,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {12447#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12447#true} is VALID [2018-11-18 22:44:21,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,389 INFO L273 TraceCheckUtils]: 32: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,390 INFO L273 TraceCheckUtils]: 33: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,390 INFO L273 TraceCheckUtils]: 34: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,390 INFO L273 TraceCheckUtils]: 35: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,390 INFO L273 TraceCheckUtils]: 37: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,390 INFO L273 TraceCheckUtils]: 38: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,390 INFO L273 TraceCheckUtils]: 39: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,391 INFO L273 TraceCheckUtils]: 40: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,391 INFO L273 TraceCheckUtils]: 41: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,391 INFO L273 TraceCheckUtils]: 43: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,391 INFO L273 TraceCheckUtils]: 45: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,391 INFO L273 TraceCheckUtils]: 46: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 48: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 49: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 50: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 51: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 52: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 54: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,392 INFO L273 TraceCheckUtils]: 55: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 56: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 57: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 58: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 59: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 61: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 62: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,393 INFO L273 TraceCheckUtils]: 64: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,394 INFO L273 TraceCheckUtils]: 65: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,394 INFO L273 TraceCheckUtils]: 66: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,394 INFO L273 TraceCheckUtils]: 67: Hoare triple {12447#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12447#true} is VALID [2018-11-18 22:44:21,394 INFO L273 TraceCheckUtils]: 68: Hoare triple {12447#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12447#true} is VALID [2018-11-18 22:44:21,394 INFO L273 TraceCheckUtils]: 69: Hoare triple {12447#true} assume true; {12447#true} is VALID [2018-11-18 22:44:21,394 INFO L273 TraceCheckUtils]: 70: Hoare triple {12447#true} assume !(~a~0 < 100000); {12447#true} is VALID [2018-11-18 22:44:21,395 INFO L273 TraceCheckUtils]: 71: Hoare triple {12447#true} havoc ~i~0;~i~0 := 0; {12687#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:21,395 INFO L273 TraceCheckUtils]: 72: Hoare triple {12687#(<= main_~i~0 0)} assume true; {12687#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:21,395 INFO L273 TraceCheckUtils]: 73: Hoare triple {12687#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12687#(<= main_~i~0 0)} is VALID [2018-11-18 22:44:21,396 INFO L273 TraceCheckUtils]: 74: Hoare triple {12687#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12697#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:21,396 INFO L273 TraceCheckUtils]: 75: Hoare triple {12697#(<= main_~i~0 1)} assume true; {12697#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:21,396 INFO L273 TraceCheckUtils]: 76: Hoare triple {12697#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12697#(<= main_~i~0 1)} is VALID [2018-11-18 22:44:21,397 INFO L273 TraceCheckUtils]: 77: Hoare triple {12697#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12707#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:21,398 INFO L273 TraceCheckUtils]: 78: Hoare triple {12707#(<= main_~i~0 2)} assume true; {12707#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:21,398 INFO L273 TraceCheckUtils]: 79: Hoare triple {12707#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12707#(<= main_~i~0 2)} is VALID [2018-11-18 22:44:21,399 INFO L273 TraceCheckUtils]: 80: Hoare triple {12707#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12717#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:21,399 INFO L273 TraceCheckUtils]: 81: Hoare triple {12717#(<= main_~i~0 3)} assume true; {12717#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:21,400 INFO L273 TraceCheckUtils]: 82: Hoare triple {12717#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12717#(<= main_~i~0 3)} is VALID [2018-11-18 22:44:21,401 INFO L273 TraceCheckUtils]: 83: Hoare triple {12717#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12727#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:21,401 INFO L273 TraceCheckUtils]: 84: Hoare triple {12727#(<= main_~i~0 4)} assume true; {12727#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:21,402 INFO L273 TraceCheckUtils]: 85: Hoare triple {12727#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12727#(<= main_~i~0 4)} is VALID [2018-11-18 22:44:21,403 INFO L273 TraceCheckUtils]: 86: Hoare triple {12727#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12737#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:21,403 INFO L273 TraceCheckUtils]: 87: Hoare triple {12737#(<= main_~i~0 5)} assume true; {12737#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:21,404 INFO L273 TraceCheckUtils]: 88: Hoare triple {12737#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12737#(<= main_~i~0 5)} is VALID [2018-11-18 22:44:21,404 INFO L273 TraceCheckUtils]: 89: Hoare triple {12737#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12747#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:21,405 INFO L273 TraceCheckUtils]: 90: Hoare triple {12747#(<= main_~i~0 6)} assume true; {12747#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:21,405 INFO L273 TraceCheckUtils]: 91: Hoare triple {12747#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12747#(<= main_~i~0 6)} is VALID [2018-11-18 22:44:21,406 INFO L273 TraceCheckUtils]: 92: Hoare triple {12747#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12757#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:21,407 INFO L273 TraceCheckUtils]: 93: Hoare triple {12757#(<= main_~i~0 7)} assume true; {12757#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:21,407 INFO L273 TraceCheckUtils]: 94: Hoare triple {12757#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12757#(<= main_~i~0 7)} is VALID [2018-11-18 22:44:21,408 INFO L273 TraceCheckUtils]: 95: Hoare triple {12757#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12767#(<= main_~i~0 8)} is VALID [2018-11-18 22:44:21,408 INFO L273 TraceCheckUtils]: 96: Hoare triple {12767#(<= main_~i~0 8)} assume true; {12767#(<= main_~i~0 8)} is VALID [2018-11-18 22:44:21,409 INFO L273 TraceCheckUtils]: 97: Hoare triple {12767#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12767#(<= main_~i~0 8)} is VALID [2018-11-18 22:44:21,410 INFO L273 TraceCheckUtils]: 98: Hoare triple {12767#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12777#(<= main_~i~0 9)} is VALID [2018-11-18 22:44:21,410 INFO L273 TraceCheckUtils]: 99: Hoare triple {12777#(<= main_~i~0 9)} assume true; {12777#(<= main_~i~0 9)} is VALID [2018-11-18 22:44:21,411 INFO L273 TraceCheckUtils]: 100: Hoare triple {12777#(<= main_~i~0 9)} assume !(~i~0 < 100000); {12448#false} is VALID [2018-11-18 22:44:21,411 INFO L273 TraceCheckUtils]: 101: Hoare triple {12448#false} havoc ~x~0;~x~0 := 0; {12448#false} is VALID [2018-11-18 22:44:21,411 INFO L273 TraceCheckUtils]: 102: Hoare triple {12448#false} assume true; {12448#false} is VALID [2018-11-18 22:44:21,411 INFO L273 TraceCheckUtils]: 103: Hoare triple {12448#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {12448#false} is VALID [2018-11-18 22:44:21,412 INFO L256 TraceCheckUtils]: 104: Hoare triple {12448#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12448#false} is VALID [2018-11-18 22:44:21,412 INFO L273 TraceCheckUtils]: 105: Hoare triple {12448#false} ~cond := #in~cond; {12448#false} is VALID [2018-11-18 22:44:21,412 INFO L273 TraceCheckUtils]: 106: Hoare triple {12448#false} assume 0 == ~cond; {12448#false} is VALID [2018-11-18 22:44:21,412 INFO L273 TraceCheckUtils]: 107: Hoare triple {12448#false} assume !false; {12448#false} is VALID [2018-11-18 22:44:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-11-18 22:44:21,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12] total 34 [2018-11-18 22:44:21,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-11-18 22:44:21,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:21,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-18 22:44:21,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:21,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 22:44:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 22:44:21,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=781, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:44:21,571 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 34 states. [2018-11-18 22:44:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:22,371 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2018-11-18 22:44:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 22:44:22,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-11-18 22:44:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:44:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 142 transitions. [2018-11-18 22:44:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:44:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 142 transitions. [2018-11-18 22:44:22,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 142 transitions. [2018-11-18 22:44:22,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:22,512 INFO L225 Difference]: With dead ends: 163 [2018-11-18 22:44:22,512 INFO L226 Difference]: Without dead ends: 121 [2018-11-18 22:44:22,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=781, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:44:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-18 22:44:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-18 22:44:22,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:22,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-18 22:44:22,558 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-18 22:44:22,558 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-18 22:44:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:22,561 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-11-18 22:44:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-11-18 22:44:22,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:22,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:22,561 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-18 22:44:22,562 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-18 22:44:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:22,564 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-11-18 22:44:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-11-18 22:44:22,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:22,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:22,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:22,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 22:44:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-11-18 22:44:22,567 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 108 [2018-11-18 22:44:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:22,567 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-11-18 22:44:22,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 22:44:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-18 22:44:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 22:44:22,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:22,568 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:22,569 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:22,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1073111318, now seen corresponding path program 22 times [2018-11-18 22:44:22,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:22,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:22,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:22,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:22,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:23,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {13423#true} call ULTIMATE.init(); {13423#true} is VALID [2018-11-18 22:44:23,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {13423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13423#true} is VALID [2018-11-18 22:44:23,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {13423#true} assume true; {13423#true} is VALID [2018-11-18 22:44:23,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13423#true} {13423#true} #66#return; {13423#true} is VALID [2018-11-18 22:44:23,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {13423#true} call #t~ret8 := main(); {13423#true} is VALID [2018-11-18 22:44:23,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {13423#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13425#(= main_~a~0 0)} is VALID [2018-11-18 22:44:23,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {13425#(= main_~a~0 0)} assume true; {13425#(= main_~a~0 0)} is VALID [2018-11-18 22:44:23,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {13425#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13425#(= main_~a~0 0)} is VALID [2018-11-18 22:44:23,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {13425#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13426#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:23,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {13426#(<= main_~a~0 1)} assume true; {13426#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:23,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {13426#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13426#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:23,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {13426#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13427#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:23,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {13427#(<= main_~a~0 2)} assume true; {13427#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:23,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {13427#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13427#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:23,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {13427#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13428#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:23,696 INFO L273 TraceCheckUtils]: 15: Hoare triple {13428#(<= main_~a~0 3)} assume true; {13428#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:23,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {13428#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13428#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:23,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {13428#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13429#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:23,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {13429#(<= main_~a~0 4)} assume true; {13429#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:23,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {13429#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13429#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:23,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {13429#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13430#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:23,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {13430#(<= main_~a~0 5)} assume true; {13430#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:23,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {13430#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13430#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:23,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {13430#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13431#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:23,701 INFO L273 TraceCheckUtils]: 24: Hoare triple {13431#(<= main_~a~0 6)} assume true; {13431#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:23,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {13431#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13431#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:23,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {13431#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13432#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:23,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {13432#(<= main_~a~0 7)} assume true; {13432#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:23,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {13432#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13432#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:23,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {13432#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13433#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:23,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {13433#(<= main_~a~0 8)} assume true; {13433#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:23,705 INFO L273 TraceCheckUtils]: 31: Hoare triple {13433#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13433#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:23,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {13433#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13434#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:23,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {13434#(<= main_~a~0 9)} assume true; {13434#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:23,707 INFO L273 TraceCheckUtils]: 34: Hoare triple {13434#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13434#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:23,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {13434#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13435#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:23,708 INFO L273 TraceCheckUtils]: 36: Hoare triple {13435#(<= main_~a~0 10)} assume true; {13435#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:23,709 INFO L273 TraceCheckUtils]: 37: Hoare triple {13435#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13435#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:23,710 INFO L273 TraceCheckUtils]: 38: Hoare triple {13435#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13436#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:23,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {13436#(<= main_~a~0 11)} assume true; {13436#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:23,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {13436#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13436#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:23,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {13436#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13437#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:23,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {13437#(<= main_~a~0 12)} assume true; {13437#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:23,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {13437#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13437#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:23,713 INFO L273 TraceCheckUtils]: 44: Hoare triple {13437#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13438#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:23,714 INFO L273 TraceCheckUtils]: 45: Hoare triple {13438#(<= main_~a~0 13)} assume true; {13438#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:23,714 INFO L273 TraceCheckUtils]: 46: Hoare triple {13438#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13438#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:23,715 INFO L273 TraceCheckUtils]: 47: Hoare triple {13438#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13439#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:23,715 INFO L273 TraceCheckUtils]: 48: Hoare triple {13439#(<= main_~a~0 14)} assume true; {13439#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:23,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {13439#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13439#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:23,717 INFO L273 TraceCheckUtils]: 50: Hoare triple {13439#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13440#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:23,717 INFO L273 TraceCheckUtils]: 51: Hoare triple {13440#(<= main_~a~0 15)} assume true; {13440#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:23,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {13440#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13440#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:23,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {13440#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13441#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:23,719 INFO L273 TraceCheckUtils]: 54: Hoare triple {13441#(<= main_~a~0 16)} assume true; {13441#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:23,720 INFO L273 TraceCheckUtils]: 55: Hoare triple {13441#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13441#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:23,720 INFO L273 TraceCheckUtils]: 56: Hoare triple {13441#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13442#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:23,721 INFO L273 TraceCheckUtils]: 57: Hoare triple {13442#(<= main_~a~0 17)} assume true; {13442#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:23,721 INFO L273 TraceCheckUtils]: 58: Hoare triple {13442#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13442#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:23,722 INFO L273 TraceCheckUtils]: 59: Hoare triple {13442#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13443#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:23,723 INFO L273 TraceCheckUtils]: 60: Hoare triple {13443#(<= main_~a~0 18)} assume true; {13443#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:23,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {13443#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13443#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:23,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {13443#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13444#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:23,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {13444#(<= main_~a~0 19)} assume true; {13444#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:23,725 INFO L273 TraceCheckUtils]: 64: Hoare triple {13444#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13444#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:23,726 INFO L273 TraceCheckUtils]: 65: Hoare triple {13444#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13445#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:23,726 INFO L273 TraceCheckUtils]: 66: Hoare triple {13445#(<= main_~a~0 20)} assume true; {13445#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:23,727 INFO L273 TraceCheckUtils]: 67: Hoare triple {13445#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13445#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:23,727 INFO L273 TraceCheckUtils]: 68: Hoare triple {13445#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13446#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:23,728 INFO L273 TraceCheckUtils]: 69: Hoare triple {13446#(<= main_~a~0 21)} assume true; {13446#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:23,728 INFO L273 TraceCheckUtils]: 70: Hoare triple {13446#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13446#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:23,729 INFO L273 TraceCheckUtils]: 71: Hoare triple {13446#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13447#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:23,730 INFO L273 TraceCheckUtils]: 72: Hoare triple {13447#(<= main_~a~0 22)} assume true; {13447#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:23,730 INFO L273 TraceCheckUtils]: 73: Hoare triple {13447#(<= main_~a~0 22)} assume !(~a~0 < 100000); {13424#false} is VALID [2018-11-18 22:44:23,731 INFO L273 TraceCheckUtils]: 74: Hoare triple {13424#false} havoc ~i~0;~i~0 := 0; {13424#false} is VALID [2018-11-18 22:44:23,731 INFO L273 TraceCheckUtils]: 75: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,731 INFO L273 TraceCheckUtils]: 76: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,731 INFO L273 TraceCheckUtils]: 77: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,731 INFO L273 TraceCheckUtils]: 78: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,732 INFO L273 TraceCheckUtils]: 79: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,732 INFO L273 TraceCheckUtils]: 80: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,732 INFO L273 TraceCheckUtils]: 81: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,732 INFO L273 TraceCheckUtils]: 82: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,732 INFO L273 TraceCheckUtils]: 83: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 84: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 85: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 86: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 87: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 88: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 89: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 90: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,733 INFO L273 TraceCheckUtils]: 91: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 92: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 93: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 94: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 95: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 96: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 97: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 98: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 99: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,734 INFO L273 TraceCheckUtils]: 100: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 101: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 102: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 103: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 104: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 105: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 106: Hoare triple {13424#false} assume !(~i~0 < 100000); {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 107: Hoare triple {13424#false} havoc ~x~0;~x~0 := 0; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 108: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:23,735 INFO L273 TraceCheckUtils]: 109: Hoare triple {13424#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13424#false} is VALID [2018-11-18 22:44:23,736 INFO L256 TraceCheckUtils]: 110: Hoare triple {13424#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {13424#false} is VALID [2018-11-18 22:44:23,736 INFO L273 TraceCheckUtils]: 111: Hoare triple {13424#false} ~cond := #in~cond; {13424#false} is VALID [2018-11-18 22:44:23,736 INFO L273 TraceCheckUtils]: 112: Hoare triple {13424#false} assume 0 == ~cond; {13424#false} is VALID [2018-11-18 22:44:23,736 INFO L273 TraceCheckUtils]: 113: Hoare triple {13424#false} assume !false; {13424#false} is VALID [2018-11-18 22:44:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 22:44:23,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:23,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:23,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:44:23,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:44:23,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:23,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:24,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {13423#true} call ULTIMATE.init(); {13423#true} is VALID [2018-11-18 22:44:24,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {13423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13423#true} is VALID [2018-11-18 22:44:24,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {13423#true} assume true; {13423#true} is VALID [2018-11-18 22:44:24,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13423#true} {13423#true} #66#return; {13423#true} is VALID [2018-11-18 22:44:24,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {13423#true} call #t~ret8 := main(); {13423#true} is VALID [2018-11-18 22:44:24,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {13423#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13466#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:24,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {13466#(<= main_~a~0 0)} assume true; {13466#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:24,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {13466#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13466#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:24,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {13466#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13426#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:24,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {13426#(<= main_~a~0 1)} assume true; {13426#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:24,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {13426#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13426#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:24,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {13426#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13427#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:24,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {13427#(<= main_~a~0 2)} assume true; {13427#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:24,050 INFO L273 TraceCheckUtils]: 13: Hoare triple {13427#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13427#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:24,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {13427#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13428#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:24,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {13428#(<= main_~a~0 3)} assume true; {13428#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:24,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {13428#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13428#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:24,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {13428#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13429#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:24,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {13429#(<= main_~a~0 4)} assume true; {13429#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:24,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {13429#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13429#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:24,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {13429#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13430#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:24,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {13430#(<= main_~a~0 5)} assume true; {13430#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:24,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {13430#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13430#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:24,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {13430#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13431#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:24,057 INFO L273 TraceCheckUtils]: 24: Hoare triple {13431#(<= main_~a~0 6)} assume true; {13431#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:24,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {13431#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13431#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:24,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {13431#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13432#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:24,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {13432#(<= main_~a~0 7)} assume true; {13432#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:24,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {13432#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13432#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:24,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {13432#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13433#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:24,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {13433#(<= main_~a~0 8)} assume true; {13433#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:24,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {13433#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13433#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:24,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {13433#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13434#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:24,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {13434#(<= main_~a~0 9)} assume true; {13434#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:24,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {13434#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13434#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:24,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {13434#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13435#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:24,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {13435#(<= main_~a~0 10)} assume true; {13435#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:24,064 INFO L273 TraceCheckUtils]: 37: Hoare triple {13435#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13435#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:24,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {13435#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13436#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:24,066 INFO L273 TraceCheckUtils]: 39: Hoare triple {13436#(<= main_~a~0 11)} assume true; {13436#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:24,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {13436#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13436#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:24,067 INFO L273 TraceCheckUtils]: 41: Hoare triple {13436#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13437#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:24,068 INFO L273 TraceCheckUtils]: 42: Hoare triple {13437#(<= main_~a~0 12)} assume true; {13437#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:24,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {13437#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13437#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:24,069 INFO L273 TraceCheckUtils]: 44: Hoare triple {13437#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13438#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:24,069 INFO L273 TraceCheckUtils]: 45: Hoare triple {13438#(<= main_~a~0 13)} assume true; {13438#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:24,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {13438#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13438#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:24,071 INFO L273 TraceCheckUtils]: 47: Hoare triple {13438#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13439#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:24,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {13439#(<= main_~a~0 14)} assume true; {13439#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:24,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {13439#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13439#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:24,072 INFO L273 TraceCheckUtils]: 50: Hoare triple {13439#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13440#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:24,073 INFO L273 TraceCheckUtils]: 51: Hoare triple {13440#(<= main_~a~0 15)} assume true; {13440#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:24,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {13440#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13440#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:24,074 INFO L273 TraceCheckUtils]: 53: Hoare triple {13440#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13441#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:24,075 INFO L273 TraceCheckUtils]: 54: Hoare triple {13441#(<= main_~a~0 16)} assume true; {13441#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:24,075 INFO L273 TraceCheckUtils]: 55: Hoare triple {13441#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13441#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:24,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {13441#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13442#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:24,077 INFO L273 TraceCheckUtils]: 57: Hoare triple {13442#(<= main_~a~0 17)} assume true; {13442#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:24,077 INFO L273 TraceCheckUtils]: 58: Hoare triple {13442#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13442#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:24,078 INFO L273 TraceCheckUtils]: 59: Hoare triple {13442#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13443#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:24,078 INFO L273 TraceCheckUtils]: 60: Hoare triple {13443#(<= main_~a~0 18)} assume true; {13443#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:24,079 INFO L273 TraceCheckUtils]: 61: Hoare triple {13443#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13443#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:24,080 INFO L273 TraceCheckUtils]: 62: Hoare triple {13443#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13444#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:24,080 INFO L273 TraceCheckUtils]: 63: Hoare triple {13444#(<= main_~a~0 19)} assume true; {13444#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:24,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {13444#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13444#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:24,081 INFO L273 TraceCheckUtils]: 65: Hoare triple {13444#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13445#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:24,082 INFO L273 TraceCheckUtils]: 66: Hoare triple {13445#(<= main_~a~0 20)} assume true; {13445#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:24,082 INFO L273 TraceCheckUtils]: 67: Hoare triple {13445#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13445#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:24,083 INFO L273 TraceCheckUtils]: 68: Hoare triple {13445#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13446#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:24,084 INFO L273 TraceCheckUtils]: 69: Hoare triple {13446#(<= main_~a~0 21)} assume true; {13446#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:24,084 INFO L273 TraceCheckUtils]: 70: Hoare triple {13446#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13446#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:24,085 INFO L273 TraceCheckUtils]: 71: Hoare triple {13446#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13447#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:24,085 INFO L273 TraceCheckUtils]: 72: Hoare triple {13447#(<= main_~a~0 22)} assume true; {13447#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:24,086 INFO L273 TraceCheckUtils]: 73: Hoare triple {13447#(<= main_~a~0 22)} assume !(~a~0 < 100000); {13424#false} is VALID [2018-11-18 22:44:24,086 INFO L273 TraceCheckUtils]: 74: Hoare triple {13424#false} havoc ~i~0;~i~0 := 0; {13424#false} is VALID [2018-11-18 22:44:24,087 INFO L273 TraceCheckUtils]: 75: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,087 INFO L273 TraceCheckUtils]: 76: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,087 INFO L273 TraceCheckUtils]: 77: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,087 INFO L273 TraceCheckUtils]: 78: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,087 INFO L273 TraceCheckUtils]: 79: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,088 INFO L273 TraceCheckUtils]: 80: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,088 INFO L273 TraceCheckUtils]: 81: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,088 INFO L273 TraceCheckUtils]: 82: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,088 INFO L273 TraceCheckUtils]: 83: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,088 INFO L273 TraceCheckUtils]: 84: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,088 INFO L273 TraceCheckUtils]: 85: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,089 INFO L273 TraceCheckUtils]: 86: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,089 INFO L273 TraceCheckUtils]: 87: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,089 INFO L273 TraceCheckUtils]: 88: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,089 INFO L273 TraceCheckUtils]: 89: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,089 INFO L273 TraceCheckUtils]: 90: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 91: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 92: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 93: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 94: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 95: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 96: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 97: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 98: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,090 INFO L273 TraceCheckUtils]: 99: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 100: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 101: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 102: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 103: Hoare triple {13424#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 104: Hoare triple {13424#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 105: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 106: Hoare triple {13424#false} assume !(~i~0 < 100000); {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 107: Hoare triple {13424#false} havoc ~x~0;~x~0 := 0; {13424#false} is VALID [2018-11-18 22:44:24,091 INFO L273 TraceCheckUtils]: 108: Hoare triple {13424#false} assume true; {13424#false} is VALID [2018-11-18 22:44:24,092 INFO L273 TraceCheckUtils]: 109: Hoare triple {13424#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13424#false} is VALID [2018-11-18 22:44:24,092 INFO L256 TraceCheckUtils]: 110: Hoare triple {13424#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {13424#false} is VALID [2018-11-18 22:44:24,092 INFO L273 TraceCheckUtils]: 111: Hoare triple {13424#false} ~cond := #in~cond; {13424#false} is VALID [2018-11-18 22:44:24,092 INFO L273 TraceCheckUtils]: 112: Hoare triple {13424#false} assume 0 == ~cond; {13424#false} is VALID [2018-11-18 22:44:24,092 INFO L273 TraceCheckUtils]: 113: Hoare triple {13424#false} assume !false; {13424#false} is VALID [2018-11-18 22:44:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 22:44:24,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:24,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-18 22:44:24,120 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 114 [2018-11-18 22:44:24,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:24,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:44:24,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:24,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:44:24,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:44:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:44:24,213 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 26 states. [2018-11-18 22:44:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:24,599 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-11-18 22:44:24,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:44:24,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 114 [2018-11-18 22:44:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:44:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 114 transitions. [2018-11-18 22:44:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:44:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 114 transitions. [2018-11-18 22:44:24,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 114 transitions. [2018-11-18 22:44:24,711 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-18 22:44:24,713 INFO L225 Difference]: With dead ends: 168 [2018-11-18 22:44:24,713 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 22:44:24,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:44:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 22:44:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-18 22:44:24,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:24,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-18 22:44:24,768 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-18 22:44:24,769 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-18 22:44:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:24,771 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-11-18 22:44:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-11-18 22:44:24,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:24,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:24,772 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-18 22:44:24,772 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-18 22:44:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:24,773 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-11-18 22:44:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-11-18 22:44:24,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:24,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:24,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:24,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 22:44:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-11-18 22:44:24,775 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 114 [2018-11-18 22:44:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:24,776 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-11-18 22:44:24,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:44:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-11-18 22:44:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 22:44:24,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:24,777 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:24,777 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:24,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1369733041, now seen corresponding path program 23 times [2018-11-18 22:44:24,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:24,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:24,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:24,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:24,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:25,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {14424#true} call ULTIMATE.init(); {14424#true} is VALID [2018-11-18 22:44:25,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {14424#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14424#true} is VALID [2018-11-18 22:44:25,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {14424#true} assume true; {14424#true} is VALID [2018-11-18 22:44:25,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14424#true} {14424#true} #66#return; {14424#true} is VALID [2018-11-18 22:44:25,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {14424#true} call #t~ret8 := main(); {14424#true} is VALID [2018-11-18 22:44:25,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {14424#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14426#(= main_~a~0 0)} is VALID [2018-11-18 22:44:25,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {14426#(= main_~a~0 0)} assume true; {14426#(= main_~a~0 0)} is VALID [2018-11-18 22:44:25,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {14426#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14426#(= main_~a~0 0)} is VALID [2018-11-18 22:44:25,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {14426#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14427#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:25,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {14427#(<= main_~a~0 1)} assume true; {14427#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:25,729 INFO L273 TraceCheckUtils]: 10: Hoare triple {14427#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14427#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:25,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {14427#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14428#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:25,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {14428#(<= main_~a~0 2)} assume true; {14428#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:25,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {14428#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14428#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:25,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {14428#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14429#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:25,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {14429#(<= main_~a~0 3)} assume true; {14429#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:25,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {14429#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14429#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:25,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {14429#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14430#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:25,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {14430#(<= main_~a~0 4)} assume true; {14430#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:25,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {14430#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14430#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:25,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {14430#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14431#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:25,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {14431#(<= main_~a~0 5)} assume true; {14431#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:25,735 INFO L273 TraceCheckUtils]: 22: Hoare triple {14431#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14431#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:25,736 INFO L273 TraceCheckUtils]: 23: Hoare triple {14431#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14432#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:25,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {14432#(<= main_~a~0 6)} assume true; {14432#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:25,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {14432#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14432#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:25,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {14432#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14433#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:25,738 INFO L273 TraceCheckUtils]: 27: Hoare triple {14433#(<= main_~a~0 7)} assume true; {14433#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:25,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {14433#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14433#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:25,739 INFO L273 TraceCheckUtils]: 29: Hoare triple {14433#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14434#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:25,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {14434#(<= main_~a~0 8)} assume true; {14434#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:25,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {14434#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14434#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:25,741 INFO L273 TraceCheckUtils]: 32: Hoare triple {14434#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14435#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:25,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {14435#(<= main_~a~0 9)} assume true; {14435#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:25,742 INFO L273 TraceCheckUtils]: 34: Hoare triple {14435#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14435#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:25,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {14435#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14436#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:25,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {14436#(<= main_~a~0 10)} assume true; {14436#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:25,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {14436#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14436#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:25,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {14436#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14437#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:25,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {14437#(<= main_~a~0 11)} assume true; {14437#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:25,746 INFO L273 TraceCheckUtils]: 40: Hoare triple {14437#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14437#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:25,747 INFO L273 TraceCheckUtils]: 41: Hoare triple {14437#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14438#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:25,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {14438#(<= main_~a~0 12)} assume true; {14438#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:25,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {14438#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14438#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:25,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {14438#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14439#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:25,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {14439#(<= main_~a~0 13)} assume true; {14439#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:25,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {14439#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14439#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:25,750 INFO L273 TraceCheckUtils]: 47: Hoare triple {14439#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14440#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:25,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {14440#(<= main_~a~0 14)} assume true; {14440#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:25,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {14440#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14440#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:25,752 INFO L273 TraceCheckUtils]: 50: Hoare triple {14440#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14441#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:25,752 INFO L273 TraceCheckUtils]: 51: Hoare triple {14441#(<= main_~a~0 15)} assume true; {14441#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:25,753 INFO L273 TraceCheckUtils]: 52: Hoare triple {14441#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14441#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:25,754 INFO L273 TraceCheckUtils]: 53: Hoare triple {14441#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14442#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:25,754 INFO L273 TraceCheckUtils]: 54: Hoare triple {14442#(<= main_~a~0 16)} assume true; {14442#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:25,755 INFO L273 TraceCheckUtils]: 55: Hoare triple {14442#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14442#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:25,755 INFO L273 TraceCheckUtils]: 56: Hoare triple {14442#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14443#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:25,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {14443#(<= main_~a~0 17)} assume true; {14443#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:25,757 INFO L273 TraceCheckUtils]: 58: Hoare triple {14443#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14443#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:25,757 INFO L273 TraceCheckUtils]: 59: Hoare triple {14443#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14444#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:25,758 INFO L273 TraceCheckUtils]: 60: Hoare triple {14444#(<= main_~a~0 18)} assume true; {14444#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:25,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {14444#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14444#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:25,759 INFO L273 TraceCheckUtils]: 62: Hoare triple {14444#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14445#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:25,760 INFO L273 TraceCheckUtils]: 63: Hoare triple {14445#(<= main_~a~0 19)} assume true; {14445#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:25,760 INFO L273 TraceCheckUtils]: 64: Hoare triple {14445#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14445#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:25,761 INFO L273 TraceCheckUtils]: 65: Hoare triple {14445#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14446#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:25,761 INFO L273 TraceCheckUtils]: 66: Hoare triple {14446#(<= main_~a~0 20)} assume true; {14446#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:25,762 INFO L273 TraceCheckUtils]: 67: Hoare triple {14446#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14446#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:25,763 INFO L273 TraceCheckUtils]: 68: Hoare triple {14446#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14447#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:25,763 INFO L273 TraceCheckUtils]: 69: Hoare triple {14447#(<= main_~a~0 21)} assume true; {14447#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:25,764 INFO L273 TraceCheckUtils]: 70: Hoare triple {14447#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14447#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:25,764 INFO L273 TraceCheckUtils]: 71: Hoare triple {14447#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14448#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:25,765 INFO L273 TraceCheckUtils]: 72: Hoare triple {14448#(<= main_~a~0 22)} assume true; {14448#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:25,765 INFO L273 TraceCheckUtils]: 73: Hoare triple {14448#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14448#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:25,766 INFO L273 TraceCheckUtils]: 74: Hoare triple {14448#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14449#(<= main_~a~0 23)} is VALID [2018-11-18 22:44:25,767 INFO L273 TraceCheckUtils]: 75: Hoare triple {14449#(<= main_~a~0 23)} assume true; {14449#(<= main_~a~0 23)} is VALID [2018-11-18 22:44:25,767 INFO L273 TraceCheckUtils]: 76: Hoare triple {14449#(<= main_~a~0 23)} assume !(~a~0 < 100000); {14425#false} is VALID [2018-11-18 22:44:25,768 INFO L273 TraceCheckUtils]: 77: Hoare triple {14425#false} havoc ~i~0;~i~0 := 0; {14425#false} is VALID [2018-11-18 22:44:25,768 INFO L273 TraceCheckUtils]: 78: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,768 INFO L273 TraceCheckUtils]: 79: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,768 INFO L273 TraceCheckUtils]: 80: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,768 INFO L273 TraceCheckUtils]: 81: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,769 INFO L273 TraceCheckUtils]: 82: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,769 INFO L273 TraceCheckUtils]: 83: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,769 INFO L273 TraceCheckUtils]: 84: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,769 INFO L273 TraceCheckUtils]: 85: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,769 INFO L273 TraceCheckUtils]: 86: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 87: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 88: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 89: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 90: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 91: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 92: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 93: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,770 INFO L273 TraceCheckUtils]: 94: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 95: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 96: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 97: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 98: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 99: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 100: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 101: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 102: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,771 INFO L273 TraceCheckUtils]: 103: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 104: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 105: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 106: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 107: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 108: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 109: Hoare triple {14425#false} assume !(~i~0 < 100000); {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 110: Hoare triple {14425#false} havoc ~x~0;~x~0 := 0; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 111: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:25,772 INFO L273 TraceCheckUtils]: 112: Hoare triple {14425#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {14425#false} is VALID [2018-11-18 22:44:25,773 INFO L256 TraceCheckUtils]: 113: Hoare triple {14425#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {14425#false} is VALID [2018-11-18 22:44:25,773 INFO L273 TraceCheckUtils]: 114: Hoare triple {14425#false} ~cond := #in~cond; {14425#false} is VALID [2018-11-18 22:44:25,773 INFO L273 TraceCheckUtils]: 115: Hoare triple {14425#false} assume 0 == ~cond; {14425#false} is VALID [2018-11-18 22:44:25,773 INFO L273 TraceCheckUtils]: 116: Hoare triple {14425#false} assume !false; {14425#false} is VALID [2018-11-18 22:44:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 22:44:25,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:25,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:25,790 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:44:45,234 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-18 22:44:45,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:44:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:45,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:44:45,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {14424#true} call ULTIMATE.init(); {14424#true} is VALID [2018-11-18 22:44:45,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {14424#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14424#true} is VALID [2018-11-18 22:44:45,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {14424#true} assume true; {14424#true} is VALID [2018-11-18 22:44:45,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14424#true} {14424#true} #66#return; {14424#true} is VALID [2018-11-18 22:44:45,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {14424#true} call #t~ret8 := main(); {14424#true} is VALID [2018-11-18 22:44:45,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {14424#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14468#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:45,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {14468#(<= main_~a~0 0)} assume true; {14468#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:45,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {14468#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14468#(<= main_~a~0 0)} is VALID [2018-11-18 22:44:45,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {14468#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14427#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:45,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {14427#(<= main_~a~0 1)} assume true; {14427#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:45,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {14427#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14427#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:45,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {14427#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14428#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:45,550 INFO L273 TraceCheckUtils]: 12: Hoare triple {14428#(<= main_~a~0 2)} assume true; {14428#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:45,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {14428#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14428#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:45,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {14428#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14429#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:45,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {14429#(<= main_~a~0 3)} assume true; {14429#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:45,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {14429#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14429#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:45,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {14429#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14430#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:45,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {14430#(<= main_~a~0 4)} assume true; {14430#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:45,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {14430#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14430#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:45,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {14430#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14431#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:45,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {14431#(<= main_~a~0 5)} assume true; {14431#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:45,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {14431#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14431#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:45,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {14431#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14432#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:45,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {14432#(<= main_~a~0 6)} assume true; {14432#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:45,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {14432#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14432#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:45,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {14432#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14433#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:45,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {14433#(<= main_~a~0 7)} assume true; {14433#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:45,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {14433#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14433#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:45,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {14433#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14434#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:45,561 INFO L273 TraceCheckUtils]: 30: Hoare triple {14434#(<= main_~a~0 8)} assume true; {14434#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:45,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {14434#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14434#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:45,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {14434#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14435#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:45,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {14435#(<= main_~a~0 9)} assume true; {14435#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:45,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {14435#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14435#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:45,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {14435#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14436#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:45,565 INFO L273 TraceCheckUtils]: 36: Hoare triple {14436#(<= main_~a~0 10)} assume true; {14436#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:45,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {14436#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14436#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:45,566 INFO L273 TraceCheckUtils]: 38: Hoare triple {14436#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14437#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:45,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {14437#(<= main_~a~0 11)} assume true; {14437#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:45,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {14437#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14437#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:45,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {14437#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14438#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:45,568 INFO L273 TraceCheckUtils]: 42: Hoare triple {14438#(<= main_~a~0 12)} assume true; {14438#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:45,569 INFO L273 TraceCheckUtils]: 43: Hoare triple {14438#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14438#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:45,569 INFO L273 TraceCheckUtils]: 44: Hoare triple {14438#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14439#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:45,570 INFO L273 TraceCheckUtils]: 45: Hoare triple {14439#(<= main_~a~0 13)} assume true; {14439#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:45,570 INFO L273 TraceCheckUtils]: 46: Hoare triple {14439#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14439#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:45,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {14439#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14440#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:45,572 INFO L273 TraceCheckUtils]: 48: Hoare triple {14440#(<= main_~a~0 14)} assume true; {14440#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:45,572 INFO L273 TraceCheckUtils]: 49: Hoare triple {14440#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14440#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:45,573 INFO L273 TraceCheckUtils]: 50: Hoare triple {14440#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14441#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:45,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {14441#(<= main_~a~0 15)} assume true; {14441#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:45,574 INFO L273 TraceCheckUtils]: 52: Hoare triple {14441#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14441#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:45,575 INFO L273 TraceCheckUtils]: 53: Hoare triple {14441#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14442#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:45,575 INFO L273 TraceCheckUtils]: 54: Hoare triple {14442#(<= main_~a~0 16)} assume true; {14442#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:45,576 INFO L273 TraceCheckUtils]: 55: Hoare triple {14442#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14442#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:45,577 INFO L273 TraceCheckUtils]: 56: Hoare triple {14442#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14443#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:45,577 INFO L273 TraceCheckUtils]: 57: Hoare triple {14443#(<= main_~a~0 17)} assume true; {14443#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:45,578 INFO L273 TraceCheckUtils]: 58: Hoare triple {14443#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14443#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:45,578 INFO L273 TraceCheckUtils]: 59: Hoare triple {14443#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14444#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:45,579 INFO L273 TraceCheckUtils]: 60: Hoare triple {14444#(<= main_~a~0 18)} assume true; {14444#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:45,579 INFO L273 TraceCheckUtils]: 61: Hoare triple {14444#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14444#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:45,580 INFO L273 TraceCheckUtils]: 62: Hoare triple {14444#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14445#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:45,581 INFO L273 TraceCheckUtils]: 63: Hoare triple {14445#(<= main_~a~0 19)} assume true; {14445#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:45,581 INFO L273 TraceCheckUtils]: 64: Hoare triple {14445#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14445#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:45,582 INFO L273 TraceCheckUtils]: 65: Hoare triple {14445#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14446#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:45,582 INFO L273 TraceCheckUtils]: 66: Hoare triple {14446#(<= main_~a~0 20)} assume true; {14446#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:45,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {14446#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14446#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:45,584 INFO L273 TraceCheckUtils]: 68: Hoare triple {14446#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14447#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:45,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {14447#(<= main_~a~0 21)} assume true; {14447#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:45,585 INFO L273 TraceCheckUtils]: 70: Hoare triple {14447#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14447#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:45,586 INFO L273 TraceCheckUtils]: 71: Hoare triple {14447#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14448#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:45,586 INFO L273 TraceCheckUtils]: 72: Hoare triple {14448#(<= main_~a~0 22)} assume true; {14448#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:45,587 INFO L273 TraceCheckUtils]: 73: Hoare triple {14448#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14448#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:45,587 INFO L273 TraceCheckUtils]: 74: Hoare triple {14448#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14449#(<= main_~a~0 23)} is VALID [2018-11-18 22:44:45,588 INFO L273 TraceCheckUtils]: 75: Hoare triple {14449#(<= main_~a~0 23)} assume true; {14449#(<= main_~a~0 23)} is VALID [2018-11-18 22:44:45,590 INFO L273 TraceCheckUtils]: 76: Hoare triple {14449#(<= main_~a~0 23)} assume !(~a~0 < 100000); {14425#false} is VALID [2018-11-18 22:44:45,591 INFO L273 TraceCheckUtils]: 77: Hoare triple {14425#false} havoc ~i~0;~i~0 := 0; {14425#false} is VALID [2018-11-18 22:44:45,591 INFO L273 TraceCheckUtils]: 78: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,591 INFO L273 TraceCheckUtils]: 79: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,591 INFO L273 TraceCheckUtils]: 80: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,591 INFO L273 TraceCheckUtils]: 81: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,591 INFO L273 TraceCheckUtils]: 82: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,592 INFO L273 TraceCheckUtils]: 83: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,592 INFO L273 TraceCheckUtils]: 84: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,592 INFO L273 TraceCheckUtils]: 85: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,592 INFO L273 TraceCheckUtils]: 86: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,592 INFO L273 TraceCheckUtils]: 87: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,592 INFO L273 TraceCheckUtils]: 88: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,592 INFO L273 TraceCheckUtils]: 89: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,593 INFO L273 TraceCheckUtils]: 90: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,593 INFO L273 TraceCheckUtils]: 91: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,593 INFO L273 TraceCheckUtils]: 92: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,593 INFO L273 TraceCheckUtils]: 93: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,593 INFO L273 TraceCheckUtils]: 94: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,593 INFO L273 TraceCheckUtils]: 96: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,594 INFO L273 TraceCheckUtils]: 97: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,594 INFO L273 TraceCheckUtils]: 98: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,594 INFO L273 TraceCheckUtils]: 99: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,594 INFO L273 TraceCheckUtils]: 100: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,594 INFO L273 TraceCheckUtils]: 101: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,594 INFO L273 TraceCheckUtils]: 102: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,594 INFO L273 TraceCheckUtils]: 103: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 104: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 105: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 106: Hoare triple {14425#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 107: Hoare triple {14425#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 108: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 109: Hoare triple {14425#false} assume !(~i~0 < 100000); {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 110: Hoare triple {14425#false} havoc ~x~0;~x~0 := 0; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 111: Hoare triple {14425#false} assume true; {14425#false} is VALID [2018-11-18 22:44:45,595 INFO L273 TraceCheckUtils]: 112: Hoare triple {14425#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {14425#false} is VALID [2018-11-18 22:44:45,596 INFO L256 TraceCheckUtils]: 113: Hoare triple {14425#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {14425#false} is VALID [2018-11-18 22:44:45,596 INFO L273 TraceCheckUtils]: 114: Hoare triple {14425#false} ~cond := #in~cond; {14425#false} is VALID [2018-11-18 22:44:45,596 INFO L273 TraceCheckUtils]: 115: Hoare triple {14425#false} assume 0 == ~cond; {14425#false} is VALID [2018-11-18 22:44:45,596 INFO L273 TraceCheckUtils]: 116: Hoare triple {14425#false} assume !false; {14425#false} is VALID [2018-11-18 22:44:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 22:44:45,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:44:45,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-18 22:44:45,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 117 [2018-11-18 22:44:45,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:44:45,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:44:45,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:45,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:44:45,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:44:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:44:45,733 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 27 states. [2018-11-18 22:44:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:46,459 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-11-18 22:44:46,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:44:46,459 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 117 [2018-11-18 22:44:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:44:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:44:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 117 transitions. [2018-11-18 22:44:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:44:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 117 transitions. [2018-11-18 22:44:46,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 117 transitions. [2018-11-18 22:44:46,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:44:46,576 INFO L225 Difference]: With dead ends: 171 [2018-11-18 22:44:46,576 INFO L226 Difference]: Without dead ends: 126 [2018-11-18 22:44:46,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:44:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-18 22:44:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-18 22:44:46,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:44:46,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-18 22:44:46,630 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-18 22:44:46,630 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-18 22:44:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:46,633 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-11-18 22:44:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-11-18 22:44:46,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:46,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:46,634 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-18 22:44:46,634 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-18 22:44:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:44:46,636 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-11-18 22:44:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-11-18 22:44:46,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:44:46,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:44:46,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:44:46,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:44:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 22:44:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-11-18 22:44:46,639 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 117 [2018-11-18 22:44:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:44:46,640 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-11-18 22:44:46,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:44:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-11-18 22:44:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 22:44:46,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:44:46,641 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:44:46,641 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:44:46,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:44:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1015212234, now seen corresponding path program 24 times [2018-11-18 22:44:46,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:44:46,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:44:46,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:46,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:44:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:44:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:44:47,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {15449#true} call ULTIMATE.init(); {15449#true} is VALID [2018-11-18 22:44:47,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {15449#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15449#true} is VALID [2018-11-18 22:44:47,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:44:47,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15449#true} {15449#true} #66#return; {15449#true} is VALID [2018-11-18 22:44:47,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {15449#true} call #t~ret8 := main(); {15449#true} is VALID [2018-11-18 22:44:47,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {15449#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15451#(= main_~a~0 0)} is VALID [2018-11-18 22:44:47,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {15451#(= main_~a~0 0)} assume true; {15451#(= main_~a~0 0)} is VALID [2018-11-18 22:44:47,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {15451#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15451#(= main_~a~0 0)} is VALID [2018-11-18 22:44:47,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {15451#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15452#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:47,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {15452#(<= main_~a~0 1)} assume true; {15452#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:47,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {15452#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15452#(<= main_~a~0 1)} is VALID [2018-11-18 22:44:47,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {15452#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15453#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:47,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {15453#(<= main_~a~0 2)} assume true; {15453#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:47,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {15453#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15453#(<= main_~a~0 2)} is VALID [2018-11-18 22:44:47,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {15453#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15454#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:47,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {15454#(<= main_~a~0 3)} assume true; {15454#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:47,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {15454#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15454#(<= main_~a~0 3)} is VALID [2018-11-18 22:44:47,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {15454#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15455#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:47,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {15455#(<= main_~a~0 4)} assume true; {15455#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:47,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {15455#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15455#(<= main_~a~0 4)} is VALID [2018-11-18 22:44:47,190 INFO L273 TraceCheckUtils]: 20: Hoare triple {15455#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15456#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:47,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {15456#(<= main_~a~0 5)} assume true; {15456#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:47,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {15456#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15456#(<= main_~a~0 5)} is VALID [2018-11-18 22:44:47,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {15456#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15457#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:47,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {15457#(<= main_~a~0 6)} assume true; {15457#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:47,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {15457#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15457#(<= main_~a~0 6)} is VALID [2018-11-18 22:44:47,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {15457#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15458#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:47,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {15458#(<= main_~a~0 7)} assume true; {15458#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:47,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {15458#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15458#(<= main_~a~0 7)} is VALID [2018-11-18 22:44:47,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {15458#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15459#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:47,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {15459#(<= main_~a~0 8)} assume true; {15459#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:47,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {15459#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15459#(<= main_~a~0 8)} is VALID [2018-11-18 22:44:47,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {15459#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15460#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:47,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {15460#(<= main_~a~0 9)} assume true; {15460#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:47,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {15460#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15460#(<= main_~a~0 9)} is VALID [2018-11-18 22:44:47,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {15460#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15461#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:47,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {15461#(<= main_~a~0 10)} assume true; {15461#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:47,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {15461#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15461#(<= main_~a~0 10)} is VALID [2018-11-18 22:44:47,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {15461#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15462#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:47,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {15462#(<= main_~a~0 11)} assume true; {15462#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:47,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {15462#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15462#(<= main_~a~0 11)} is VALID [2018-11-18 22:44:47,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {15462#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15463#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:47,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {15463#(<= main_~a~0 12)} assume true; {15463#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:47,435 INFO L273 TraceCheckUtils]: 43: Hoare triple {15463#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15463#(<= main_~a~0 12)} is VALID [2018-11-18 22:44:47,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {15463#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15464#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:47,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {15464#(<= main_~a~0 13)} assume true; {15464#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:47,474 INFO L273 TraceCheckUtils]: 46: Hoare triple {15464#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15464#(<= main_~a~0 13)} is VALID [2018-11-18 22:44:47,490 INFO L273 TraceCheckUtils]: 47: Hoare triple {15464#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15465#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:47,499 INFO L273 TraceCheckUtils]: 48: Hoare triple {15465#(<= main_~a~0 14)} assume true; {15465#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:47,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {15465#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15465#(<= main_~a~0 14)} is VALID [2018-11-18 22:44:47,527 INFO L273 TraceCheckUtils]: 50: Hoare triple {15465#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15466#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:47,540 INFO L273 TraceCheckUtils]: 51: Hoare triple {15466#(<= main_~a~0 15)} assume true; {15466#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:47,552 INFO L273 TraceCheckUtils]: 52: Hoare triple {15466#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15466#(<= main_~a~0 15)} is VALID [2018-11-18 22:44:47,565 INFO L273 TraceCheckUtils]: 53: Hoare triple {15466#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15467#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:47,584 INFO L273 TraceCheckUtils]: 54: Hoare triple {15467#(<= main_~a~0 16)} assume true; {15467#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:47,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {15467#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15467#(<= main_~a~0 16)} is VALID [2018-11-18 22:44:47,593 INFO L273 TraceCheckUtils]: 56: Hoare triple {15467#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15468#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:47,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {15468#(<= main_~a~0 17)} assume true; {15468#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:47,594 INFO L273 TraceCheckUtils]: 58: Hoare triple {15468#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15468#(<= main_~a~0 17)} is VALID [2018-11-18 22:44:47,597 INFO L273 TraceCheckUtils]: 59: Hoare triple {15468#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15469#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:47,597 INFO L273 TraceCheckUtils]: 60: Hoare triple {15469#(<= main_~a~0 18)} assume true; {15469#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:47,600 INFO L273 TraceCheckUtils]: 61: Hoare triple {15469#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15469#(<= main_~a~0 18)} is VALID [2018-11-18 22:44:47,600 INFO L273 TraceCheckUtils]: 62: Hoare triple {15469#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15470#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:47,601 INFO L273 TraceCheckUtils]: 63: Hoare triple {15470#(<= main_~a~0 19)} assume true; {15470#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:47,602 INFO L273 TraceCheckUtils]: 64: Hoare triple {15470#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15470#(<= main_~a~0 19)} is VALID [2018-11-18 22:44:47,602 INFO L273 TraceCheckUtils]: 65: Hoare triple {15470#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15471#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:47,602 INFO L273 TraceCheckUtils]: 66: Hoare triple {15471#(<= main_~a~0 20)} assume true; {15471#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:47,603 INFO L273 TraceCheckUtils]: 67: Hoare triple {15471#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15471#(<= main_~a~0 20)} is VALID [2018-11-18 22:44:47,603 INFO L273 TraceCheckUtils]: 68: Hoare triple {15471#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15472#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:47,603 INFO L273 TraceCheckUtils]: 69: Hoare triple {15472#(<= main_~a~0 21)} assume true; {15472#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:47,604 INFO L273 TraceCheckUtils]: 70: Hoare triple {15472#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15472#(<= main_~a~0 21)} is VALID [2018-11-18 22:44:47,604 INFO L273 TraceCheckUtils]: 71: Hoare triple {15472#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15473#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:47,605 INFO L273 TraceCheckUtils]: 72: Hoare triple {15473#(<= main_~a~0 22)} assume true; {15473#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:47,605 INFO L273 TraceCheckUtils]: 73: Hoare triple {15473#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15473#(<= main_~a~0 22)} is VALID [2018-11-18 22:44:47,606 INFO L273 TraceCheckUtils]: 74: Hoare triple {15473#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15474#(<= main_~a~0 23)} is VALID [2018-11-18 22:44:47,607 INFO L273 TraceCheckUtils]: 75: Hoare triple {15474#(<= main_~a~0 23)} assume true; {15474#(<= main_~a~0 23)} is VALID [2018-11-18 22:44:47,607 INFO L273 TraceCheckUtils]: 76: Hoare triple {15474#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15474#(<= main_~a~0 23)} is VALID [2018-11-18 22:44:47,608 INFO L273 TraceCheckUtils]: 77: Hoare triple {15474#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15475#(<= main_~a~0 24)} is VALID [2018-11-18 22:44:47,608 INFO L273 TraceCheckUtils]: 78: Hoare triple {15475#(<= main_~a~0 24)} assume true; {15475#(<= main_~a~0 24)} is VALID [2018-11-18 22:44:47,609 INFO L273 TraceCheckUtils]: 79: Hoare triple {15475#(<= main_~a~0 24)} assume !(~a~0 < 100000); {15450#false} is VALID [2018-11-18 22:44:47,609 INFO L273 TraceCheckUtils]: 80: Hoare triple {15450#false} havoc ~i~0;~i~0 := 0; {15450#false} is VALID [2018-11-18 22:44:47,610 INFO L273 TraceCheckUtils]: 81: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,610 INFO L273 TraceCheckUtils]: 82: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,610 INFO L273 TraceCheckUtils]: 83: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,610 INFO L273 TraceCheckUtils]: 84: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,610 INFO L273 TraceCheckUtils]: 85: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,610 INFO L273 TraceCheckUtils]: 86: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,611 INFO L273 TraceCheckUtils]: 87: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,611 INFO L273 TraceCheckUtils]: 88: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,611 INFO L273 TraceCheckUtils]: 89: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,611 INFO L273 TraceCheckUtils]: 90: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,611 INFO L273 TraceCheckUtils]: 91: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 92: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 93: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 94: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 95: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 96: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 97: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 98: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,612 INFO L273 TraceCheckUtils]: 99: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 100: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 101: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 102: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 103: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 104: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 105: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 106: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 107: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,613 INFO L273 TraceCheckUtils]: 108: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 109: Hoare triple {15450#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 110: Hoare triple {15450#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 111: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 112: Hoare triple {15450#false} assume !(~i~0 < 100000); {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 113: Hoare triple {15450#false} havoc ~x~0;~x~0 := 0; {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 114: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 115: Hoare triple {15450#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L256 TraceCheckUtils]: 116: Hoare triple {15450#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 117: Hoare triple {15450#false} ~cond := #in~cond; {15450#false} is VALID [2018-11-18 22:44:47,614 INFO L273 TraceCheckUtils]: 118: Hoare triple {15450#false} assume 0 == ~cond; {15450#false} is VALID [2018-11-18 22:44:47,615 INFO L273 TraceCheckUtils]: 119: Hoare triple {15450#false} assume !false; {15450#false} is VALID [2018-11-18 22:44:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-18 22:44:47,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:44:47,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:44:47,632 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:45:16,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-18 22:45:16,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:16,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:17,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {15449#true} call ULTIMATE.init(); {15449#true} is VALID [2018-11-18 22:45:17,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {15449#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15449#true} is VALID [2018-11-18 22:45:17,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15449#true} {15449#true} #66#return; {15449#true} is VALID [2018-11-18 22:45:17,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {15449#true} call #t~ret8 := main(); {15449#true} is VALID [2018-11-18 22:45:17,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {15449#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15449#true} is VALID [2018-11-18 22:45:17,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,231 INFO L273 TraceCheckUtils]: 13: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 21: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 40: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 41: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,235 INFO L273 TraceCheckUtils]: 47: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,235 INFO L273 TraceCheckUtils]: 48: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,236 INFO L273 TraceCheckUtils]: 54: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,236 INFO L273 TraceCheckUtils]: 55: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,236 INFO L273 TraceCheckUtils]: 56: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,236 INFO L273 TraceCheckUtils]: 57: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,237 INFO L273 TraceCheckUtils]: 58: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,237 INFO L273 TraceCheckUtils]: 59: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,237 INFO L273 TraceCheckUtils]: 60: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,237 INFO L273 TraceCheckUtils]: 61: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,237 INFO L273 TraceCheckUtils]: 62: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,237 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,237 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,238 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,238 INFO L273 TraceCheckUtils]: 67: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,238 INFO L273 TraceCheckUtils]: 68: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,238 INFO L273 TraceCheckUtils]: 69: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,239 INFO L273 TraceCheckUtils]: 71: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,239 INFO L273 TraceCheckUtils]: 72: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,239 INFO L273 TraceCheckUtils]: 73: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,239 INFO L273 TraceCheckUtils]: 74: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,239 INFO L273 TraceCheckUtils]: 75: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {15449#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15449#true} is VALID [2018-11-18 22:45:17,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {15449#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15449#true} is VALID [2018-11-18 22:45:17,240 INFO L273 TraceCheckUtils]: 78: Hoare triple {15449#true} assume true; {15449#true} is VALID [2018-11-18 22:45:17,240 INFO L273 TraceCheckUtils]: 79: Hoare triple {15449#true} assume !(~a~0 < 100000); {15449#true} is VALID [2018-11-18 22:45:17,246 INFO L273 TraceCheckUtils]: 80: Hoare triple {15449#true} havoc ~i~0;~i~0 := 0; {15719#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:17,247 INFO L273 TraceCheckUtils]: 81: Hoare triple {15719#(<= main_~i~0 0)} assume true; {15719#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:17,247 INFO L273 TraceCheckUtils]: 82: Hoare triple {15719#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15719#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:17,247 INFO L273 TraceCheckUtils]: 83: Hoare triple {15719#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15729#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:17,248 INFO L273 TraceCheckUtils]: 84: Hoare triple {15729#(<= main_~i~0 1)} assume true; {15729#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:17,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {15729#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15729#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:17,249 INFO L273 TraceCheckUtils]: 86: Hoare triple {15729#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15739#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:17,249 INFO L273 TraceCheckUtils]: 87: Hoare triple {15739#(<= main_~i~0 2)} assume true; {15739#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:17,249 INFO L273 TraceCheckUtils]: 88: Hoare triple {15739#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15739#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:17,250 INFO L273 TraceCheckUtils]: 89: Hoare triple {15739#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15749#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:17,250 INFO L273 TraceCheckUtils]: 90: Hoare triple {15749#(<= main_~i~0 3)} assume true; {15749#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:17,250 INFO L273 TraceCheckUtils]: 91: Hoare triple {15749#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15749#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:17,251 INFO L273 TraceCheckUtils]: 92: Hoare triple {15749#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15759#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:17,252 INFO L273 TraceCheckUtils]: 93: Hoare triple {15759#(<= main_~i~0 4)} assume true; {15759#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:17,252 INFO L273 TraceCheckUtils]: 94: Hoare triple {15759#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15759#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:17,253 INFO L273 TraceCheckUtils]: 95: Hoare triple {15759#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15769#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:17,253 INFO L273 TraceCheckUtils]: 96: Hoare triple {15769#(<= main_~i~0 5)} assume true; {15769#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:17,254 INFO L273 TraceCheckUtils]: 97: Hoare triple {15769#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15769#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:17,255 INFO L273 TraceCheckUtils]: 98: Hoare triple {15769#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15779#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:17,255 INFO L273 TraceCheckUtils]: 99: Hoare triple {15779#(<= main_~i~0 6)} assume true; {15779#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:17,256 INFO L273 TraceCheckUtils]: 100: Hoare triple {15779#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15779#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:17,256 INFO L273 TraceCheckUtils]: 101: Hoare triple {15779#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15789#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:17,257 INFO L273 TraceCheckUtils]: 102: Hoare triple {15789#(<= main_~i~0 7)} assume true; {15789#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:17,257 INFO L273 TraceCheckUtils]: 103: Hoare triple {15789#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15789#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:17,258 INFO L273 TraceCheckUtils]: 104: Hoare triple {15789#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15799#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:17,263 INFO L273 TraceCheckUtils]: 105: Hoare triple {15799#(<= main_~i~0 8)} assume true; {15799#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:17,264 INFO L273 TraceCheckUtils]: 106: Hoare triple {15799#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15799#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:17,265 INFO L273 TraceCheckUtils]: 107: Hoare triple {15799#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15809#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:17,266 INFO L273 TraceCheckUtils]: 108: Hoare triple {15809#(<= main_~i~0 9)} assume true; {15809#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:17,266 INFO L273 TraceCheckUtils]: 109: Hoare triple {15809#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15809#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:17,267 INFO L273 TraceCheckUtils]: 110: Hoare triple {15809#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15819#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:17,267 INFO L273 TraceCheckUtils]: 111: Hoare triple {15819#(<= main_~i~0 10)} assume true; {15819#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:17,268 INFO L273 TraceCheckUtils]: 112: Hoare triple {15819#(<= main_~i~0 10)} assume !(~i~0 < 100000); {15450#false} is VALID [2018-11-18 22:45:17,268 INFO L273 TraceCheckUtils]: 113: Hoare triple {15450#false} havoc ~x~0;~x~0 := 0; {15450#false} is VALID [2018-11-18 22:45:17,268 INFO L273 TraceCheckUtils]: 114: Hoare triple {15450#false} assume true; {15450#false} is VALID [2018-11-18 22:45:17,268 INFO L273 TraceCheckUtils]: 115: Hoare triple {15450#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {15450#false} is VALID [2018-11-18 22:45:17,269 INFO L256 TraceCheckUtils]: 116: Hoare triple {15450#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {15450#false} is VALID [2018-11-18 22:45:17,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {15450#false} ~cond := #in~cond; {15450#false} is VALID [2018-11-18 22:45:17,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {15450#false} assume 0 == ~cond; {15450#false} is VALID [2018-11-18 22:45:17,269 INFO L273 TraceCheckUtils]: 119: Hoare triple {15450#false} assume !false; {15450#false} is VALID [2018-11-18 22:45:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-11-18 22:45:17,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:17,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13] total 38 [2018-11-18 22:45:17,302 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 120 [2018-11-18 22:45:17,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:17,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-18 22:45:17,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:17,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 22:45:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 22:45:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 22:45:17,473 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 38 states. [2018-11-18 22:45:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:20,296 INFO L93 Difference]: Finished difference Result 178 states and 183 transitions. [2018-11-18 22:45:20,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 22:45:20,296 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 120 [2018-11-18 22:45:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:45:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2018-11-18 22:45:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:45:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2018-11-18 22:45:20,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 154 transitions. [2018-11-18 22:45:20,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:20,448 INFO L225 Difference]: With dead ends: 178 [2018-11-18 22:45:20,448 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 22:45:20,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=428, Invalid=978, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 22:45:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 22:45:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-18 22:45:20,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:20,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-18 22:45:20,491 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-18 22:45:20,491 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-18 22:45:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:20,494 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-11-18 22:45:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-11-18 22:45:20,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:20,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:20,495 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-18 22:45:20,495 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-18 22:45:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:20,496 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-11-18 22:45:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-11-18 22:45:20,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:20,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:20,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:20,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 22:45:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-11-18 22:45:20,500 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 120 [2018-11-18 22:45:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:20,500 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-11-18 22:45:20,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 22:45:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-11-18 22:45:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 22:45:20,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:20,501 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:20,501 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:20,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1033667687, now seen corresponding path program 25 times [2018-11-18 22:45:20,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:20,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:20,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:21,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {16525#true} call ULTIMATE.init(); {16525#true} is VALID [2018-11-18 22:45:21,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {16525#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16525#true} is VALID [2018-11-18 22:45:21,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {16525#true} assume true; {16525#true} is VALID [2018-11-18 22:45:21,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16525#true} {16525#true} #66#return; {16525#true} is VALID [2018-11-18 22:45:21,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {16525#true} call #t~ret8 := main(); {16525#true} is VALID [2018-11-18 22:45:21,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {16525#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16527#(= main_~a~0 0)} is VALID [2018-11-18 22:45:21,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {16527#(= main_~a~0 0)} assume true; {16527#(= main_~a~0 0)} is VALID [2018-11-18 22:45:21,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {16527#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16527#(= main_~a~0 0)} is VALID [2018-11-18 22:45:21,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {16527#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16528#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:21,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {16528#(<= main_~a~0 1)} assume true; {16528#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:21,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {16528#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16528#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:21,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {16528#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16529#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:21,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {16529#(<= main_~a~0 2)} assume true; {16529#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:21,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {16529#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16529#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:21,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {16529#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16530#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:21,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {16530#(<= main_~a~0 3)} assume true; {16530#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:21,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {16530#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16530#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:21,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {16530#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16531#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:21,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {16531#(<= main_~a~0 4)} assume true; {16531#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:21,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {16531#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16531#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:21,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {16531#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16532#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:21,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {16532#(<= main_~a~0 5)} assume true; {16532#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:21,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {16532#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16532#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:21,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {16532#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16533#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:21,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {16533#(<= main_~a~0 6)} assume true; {16533#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:21,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {16533#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16533#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:21,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {16533#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16534#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:21,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {16534#(<= main_~a~0 7)} assume true; {16534#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:21,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {16534#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16534#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:21,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {16534#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16535#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:21,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {16535#(<= main_~a~0 8)} assume true; {16535#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:21,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {16535#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16535#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:21,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {16535#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16536#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:21,179 INFO L273 TraceCheckUtils]: 33: Hoare triple {16536#(<= main_~a~0 9)} assume true; {16536#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:21,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {16536#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16536#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:21,180 INFO L273 TraceCheckUtils]: 35: Hoare triple {16536#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16537#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:21,181 INFO L273 TraceCheckUtils]: 36: Hoare triple {16537#(<= main_~a~0 10)} assume true; {16537#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:21,181 INFO L273 TraceCheckUtils]: 37: Hoare triple {16537#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16537#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:21,182 INFO L273 TraceCheckUtils]: 38: Hoare triple {16537#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16538#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:21,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {16538#(<= main_~a~0 11)} assume true; {16538#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:21,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {16538#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16538#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:21,184 INFO L273 TraceCheckUtils]: 41: Hoare triple {16538#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16539#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:21,184 INFO L273 TraceCheckUtils]: 42: Hoare triple {16539#(<= main_~a~0 12)} assume true; {16539#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:21,185 INFO L273 TraceCheckUtils]: 43: Hoare triple {16539#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16539#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:21,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {16539#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16540#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:21,186 INFO L273 TraceCheckUtils]: 45: Hoare triple {16540#(<= main_~a~0 13)} assume true; {16540#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:21,187 INFO L273 TraceCheckUtils]: 46: Hoare triple {16540#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16540#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:21,187 INFO L273 TraceCheckUtils]: 47: Hoare triple {16540#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16541#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:21,188 INFO L273 TraceCheckUtils]: 48: Hoare triple {16541#(<= main_~a~0 14)} assume true; {16541#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:21,188 INFO L273 TraceCheckUtils]: 49: Hoare triple {16541#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16541#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:21,189 INFO L273 TraceCheckUtils]: 50: Hoare triple {16541#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16542#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:21,190 INFO L273 TraceCheckUtils]: 51: Hoare triple {16542#(<= main_~a~0 15)} assume true; {16542#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:21,190 INFO L273 TraceCheckUtils]: 52: Hoare triple {16542#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16542#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:21,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {16542#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16543#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:21,191 INFO L273 TraceCheckUtils]: 54: Hoare triple {16543#(<= main_~a~0 16)} assume true; {16543#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:21,192 INFO L273 TraceCheckUtils]: 55: Hoare triple {16543#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16543#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:21,193 INFO L273 TraceCheckUtils]: 56: Hoare triple {16543#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16544#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:21,193 INFO L273 TraceCheckUtils]: 57: Hoare triple {16544#(<= main_~a~0 17)} assume true; {16544#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:21,194 INFO L273 TraceCheckUtils]: 58: Hoare triple {16544#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16544#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:21,195 INFO L273 TraceCheckUtils]: 59: Hoare triple {16544#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16545#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:21,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {16545#(<= main_~a~0 18)} assume true; {16545#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:21,196 INFO L273 TraceCheckUtils]: 61: Hoare triple {16545#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16545#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:21,196 INFO L273 TraceCheckUtils]: 62: Hoare triple {16545#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16546#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:21,197 INFO L273 TraceCheckUtils]: 63: Hoare triple {16546#(<= main_~a~0 19)} assume true; {16546#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:21,197 INFO L273 TraceCheckUtils]: 64: Hoare triple {16546#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16546#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:21,198 INFO L273 TraceCheckUtils]: 65: Hoare triple {16546#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16547#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:21,199 INFO L273 TraceCheckUtils]: 66: Hoare triple {16547#(<= main_~a~0 20)} assume true; {16547#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:21,199 INFO L273 TraceCheckUtils]: 67: Hoare triple {16547#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16547#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:21,200 INFO L273 TraceCheckUtils]: 68: Hoare triple {16547#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16548#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:21,200 INFO L273 TraceCheckUtils]: 69: Hoare triple {16548#(<= main_~a~0 21)} assume true; {16548#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:21,201 INFO L273 TraceCheckUtils]: 70: Hoare triple {16548#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16548#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:21,201 INFO L273 TraceCheckUtils]: 71: Hoare triple {16548#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16549#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:21,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {16549#(<= main_~a~0 22)} assume true; {16549#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:21,202 INFO L273 TraceCheckUtils]: 73: Hoare triple {16549#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16549#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:21,203 INFO L273 TraceCheckUtils]: 74: Hoare triple {16549#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16550#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:21,204 INFO L273 TraceCheckUtils]: 75: Hoare triple {16550#(<= main_~a~0 23)} assume true; {16550#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:21,204 INFO L273 TraceCheckUtils]: 76: Hoare triple {16550#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16550#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:21,205 INFO L273 TraceCheckUtils]: 77: Hoare triple {16550#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16551#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:21,206 INFO L273 TraceCheckUtils]: 78: Hoare triple {16551#(<= main_~a~0 24)} assume true; {16551#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:21,206 INFO L273 TraceCheckUtils]: 79: Hoare triple {16551#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16551#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:21,207 INFO L273 TraceCheckUtils]: 80: Hoare triple {16551#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16552#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:21,207 INFO L273 TraceCheckUtils]: 81: Hoare triple {16552#(<= main_~a~0 25)} assume true; {16552#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:21,208 INFO L273 TraceCheckUtils]: 82: Hoare triple {16552#(<= main_~a~0 25)} assume !(~a~0 < 100000); {16526#false} is VALID [2018-11-18 22:45:21,208 INFO L273 TraceCheckUtils]: 83: Hoare triple {16526#false} havoc ~i~0;~i~0 := 0; {16526#false} is VALID [2018-11-18 22:45:21,208 INFO L273 TraceCheckUtils]: 84: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,209 INFO L273 TraceCheckUtils]: 85: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,209 INFO L273 TraceCheckUtils]: 86: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,209 INFO L273 TraceCheckUtils]: 87: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,209 INFO L273 TraceCheckUtils]: 88: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,209 INFO L273 TraceCheckUtils]: 89: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,209 INFO L273 TraceCheckUtils]: 90: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,210 INFO L273 TraceCheckUtils]: 91: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,210 INFO L273 TraceCheckUtils]: 92: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,210 INFO L273 TraceCheckUtils]: 93: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,210 INFO L273 TraceCheckUtils]: 94: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,210 INFO L273 TraceCheckUtils]: 95: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 96: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 97: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 98: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 99: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 100: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 101: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 102: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 103: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 104: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,211 INFO L273 TraceCheckUtils]: 105: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 106: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 107: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 108: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 109: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 110: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 111: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 112: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 113: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 114: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,212 INFO L273 TraceCheckUtils]: 115: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 116: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 117: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 118: Hoare triple {16526#false} assume !(~i~0 < 100000); {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 119: Hoare triple {16526#false} havoc ~x~0;~x~0 := 0; {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 120: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 121: Hoare triple {16526#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L256 TraceCheckUtils]: 122: Hoare triple {16526#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 123: Hoare triple {16526#false} ~cond := #in~cond; {16526#false} is VALID [2018-11-18 22:45:21,213 INFO L273 TraceCheckUtils]: 124: Hoare triple {16526#false} assume 0 == ~cond; {16526#false} is VALID [2018-11-18 22:45:21,214 INFO L273 TraceCheckUtils]: 125: Hoare triple {16526#false} assume !false; {16526#false} is VALID [2018-11-18 22:45:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-18 22:45:21,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:21,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:21,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:21,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:21,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {16525#true} call ULTIMATE.init(); {16525#true} is VALID [2018-11-18 22:45:21,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {16525#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16525#true} is VALID [2018-11-18 22:45:21,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {16525#true} assume true; {16525#true} is VALID [2018-11-18 22:45:21,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16525#true} {16525#true} #66#return; {16525#true} is VALID [2018-11-18 22:45:21,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {16525#true} call #t~ret8 := main(); {16525#true} is VALID [2018-11-18 22:45:21,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {16525#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16571#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:21,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {16571#(<= main_~a~0 0)} assume true; {16571#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:21,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {16571#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16571#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:21,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {16571#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16528#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:21,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {16528#(<= main_~a~0 1)} assume true; {16528#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:21,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {16528#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16528#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:21,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {16528#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16529#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:21,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {16529#(<= main_~a~0 2)} assume true; {16529#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:21,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {16529#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16529#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:21,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {16529#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16530#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:21,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {16530#(<= main_~a~0 3)} assume true; {16530#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:21,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {16530#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16530#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:21,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {16530#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16531#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:21,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {16531#(<= main_~a~0 4)} assume true; {16531#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:21,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {16531#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16531#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:21,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {16531#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16532#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:21,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {16532#(<= main_~a~0 5)} assume true; {16532#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:21,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {16532#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16532#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:21,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {16532#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16533#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:21,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {16533#(<= main_~a~0 6)} assume true; {16533#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:21,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {16533#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16533#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:21,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {16533#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16534#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:21,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {16534#(<= main_~a~0 7)} assume true; {16534#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:21,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {16534#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16534#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:21,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {16534#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16535#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:21,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {16535#(<= main_~a~0 8)} assume true; {16535#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:21,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {16535#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16535#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:21,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {16535#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16536#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:21,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {16536#(<= main_~a~0 9)} assume true; {16536#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:21,592 INFO L273 TraceCheckUtils]: 34: Hoare triple {16536#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16536#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:21,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {16536#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16537#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:21,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {16537#(<= main_~a~0 10)} assume true; {16537#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:21,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {16537#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16537#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:21,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {16537#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16538#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:21,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {16538#(<= main_~a~0 11)} assume true; {16538#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:21,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {16538#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16538#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:21,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {16538#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16539#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:21,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {16539#(<= main_~a~0 12)} assume true; {16539#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:21,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {16539#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16539#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:21,601 INFO L273 TraceCheckUtils]: 44: Hoare triple {16539#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16540#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:21,601 INFO L273 TraceCheckUtils]: 45: Hoare triple {16540#(<= main_~a~0 13)} assume true; {16540#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:21,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {16540#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16540#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:21,602 INFO L273 TraceCheckUtils]: 47: Hoare triple {16540#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16541#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:21,603 INFO L273 TraceCheckUtils]: 48: Hoare triple {16541#(<= main_~a~0 14)} assume true; {16541#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:21,603 INFO L273 TraceCheckUtils]: 49: Hoare triple {16541#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16541#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:21,603 INFO L273 TraceCheckUtils]: 50: Hoare triple {16541#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16542#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:21,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {16542#(<= main_~a~0 15)} assume true; {16542#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:21,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {16542#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16542#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:21,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {16542#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16543#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:21,605 INFO L273 TraceCheckUtils]: 54: Hoare triple {16543#(<= main_~a~0 16)} assume true; {16543#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:21,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {16543#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16543#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:21,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {16543#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16544#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:21,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {16544#(<= main_~a~0 17)} assume true; {16544#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:21,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {16544#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16544#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:21,607 INFO L273 TraceCheckUtils]: 59: Hoare triple {16544#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16545#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:21,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {16545#(<= main_~a~0 18)} assume true; {16545#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:21,608 INFO L273 TraceCheckUtils]: 61: Hoare triple {16545#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16545#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:21,609 INFO L273 TraceCheckUtils]: 62: Hoare triple {16545#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16546#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:21,609 INFO L273 TraceCheckUtils]: 63: Hoare triple {16546#(<= main_~a~0 19)} assume true; {16546#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:21,610 INFO L273 TraceCheckUtils]: 64: Hoare triple {16546#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16546#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:21,611 INFO L273 TraceCheckUtils]: 65: Hoare triple {16546#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16547#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:21,611 INFO L273 TraceCheckUtils]: 66: Hoare triple {16547#(<= main_~a~0 20)} assume true; {16547#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:21,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {16547#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16547#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:21,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {16547#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16548#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:21,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {16548#(<= main_~a~0 21)} assume true; {16548#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:21,613 INFO L273 TraceCheckUtils]: 70: Hoare triple {16548#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16548#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:21,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {16548#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16549#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:21,615 INFO L273 TraceCheckUtils]: 72: Hoare triple {16549#(<= main_~a~0 22)} assume true; {16549#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:21,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {16549#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16549#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:21,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {16549#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16550#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:21,616 INFO L273 TraceCheckUtils]: 75: Hoare triple {16550#(<= main_~a~0 23)} assume true; {16550#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:21,617 INFO L273 TraceCheckUtils]: 76: Hoare triple {16550#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16550#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:21,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {16550#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16551#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:21,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {16551#(<= main_~a~0 24)} assume true; {16551#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:21,619 INFO L273 TraceCheckUtils]: 79: Hoare triple {16551#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16551#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:21,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {16551#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16552#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:21,620 INFO L273 TraceCheckUtils]: 81: Hoare triple {16552#(<= main_~a~0 25)} assume true; {16552#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:21,621 INFO L273 TraceCheckUtils]: 82: Hoare triple {16552#(<= main_~a~0 25)} assume !(~a~0 < 100000); {16526#false} is VALID [2018-11-18 22:45:21,621 INFO L273 TraceCheckUtils]: 83: Hoare triple {16526#false} havoc ~i~0;~i~0 := 0; {16526#false} is VALID [2018-11-18 22:45:21,621 INFO L273 TraceCheckUtils]: 84: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,621 INFO L273 TraceCheckUtils]: 85: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,621 INFO L273 TraceCheckUtils]: 86: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,621 INFO L273 TraceCheckUtils]: 87: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,622 INFO L273 TraceCheckUtils]: 88: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,622 INFO L273 TraceCheckUtils]: 89: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,622 INFO L273 TraceCheckUtils]: 90: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,622 INFO L273 TraceCheckUtils]: 91: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,622 INFO L273 TraceCheckUtils]: 92: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,623 INFO L273 TraceCheckUtils]: 93: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,623 INFO L273 TraceCheckUtils]: 94: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,623 INFO L273 TraceCheckUtils]: 95: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,623 INFO L273 TraceCheckUtils]: 96: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,623 INFO L273 TraceCheckUtils]: 97: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,623 INFO L273 TraceCheckUtils]: 98: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,623 INFO L273 TraceCheckUtils]: 99: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 100: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 101: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 102: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 103: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 104: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 105: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 106: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 107: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,624 INFO L273 TraceCheckUtils]: 108: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 109: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 110: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 111: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 112: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 113: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 114: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 115: Hoare triple {16526#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 116: Hoare triple {16526#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 117: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,625 INFO L273 TraceCheckUtils]: 118: Hoare triple {16526#false} assume !(~i~0 < 100000); {16526#false} is VALID [2018-11-18 22:45:21,626 INFO L273 TraceCheckUtils]: 119: Hoare triple {16526#false} havoc ~x~0;~x~0 := 0; {16526#false} is VALID [2018-11-18 22:45:21,626 INFO L273 TraceCheckUtils]: 120: Hoare triple {16526#false} assume true; {16526#false} is VALID [2018-11-18 22:45:21,626 INFO L273 TraceCheckUtils]: 121: Hoare triple {16526#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {16526#false} is VALID [2018-11-18 22:45:21,626 INFO L256 TraceCheckUtils]: 122: Hoare triple {16526#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {16526#false} is VALID [2018-11-18 22:45:21,626 INFO L273 TraceCheckUtils]: 123: Hoare triple {16526#false} ~cond := #in~cond; {16526#false} is VALID [2018-11-18 22:45:21,626 INFO L273 TraceCheckUtils]: 124: Hoare triple {16526#false} assume 0 == ~cond; {16526#false} is VALID [2018-11-18 22:45:21,626 INFO L273 TraceCheckUtils]: 125: Hoare triple {16526#false} assume !false; {16526#false} is VALID [2018-11-18 22:45:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-18 22:45:21,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:21,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-18 22:45:21,656 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 126 [2018-11-18 22:45:21,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:21,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 22:45:22,054 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-18 22:45:22,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 22:45:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 22:45:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:45:22,055 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 29 states. [2018-11-18 22:45:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:22,706 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-11-18 22:45:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:45:22,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 126 [2018-11-18 22:45:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:45:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 123 transitions. [2018-11-18 22:45:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:45:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 123 transitions. [2018-11-18 22:45:22,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 123 transitions. [2018-11-18 22:45:22,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:22,827 INFO L225 Difference]: With dead ends: 183 [2018-11-18 22:45:22,827 INFO L226 Difference]: Without dead ends: 135 [2018-11-18 22:45:22,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:45:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-18 22:45:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-18 22:45:22,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:22,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-18 22:45:22,865 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-18 22:45:22,865 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-18 22:45:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:22,868 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-11-18 22:45:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-11-18 22:45:22,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:22,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:22,869 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-18 22:45:22,869 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-18 22:45:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:22,870 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-11-18 22:45:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-11-18 22:45:22,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:22,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:22,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:22,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-18 22:45:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-11-18 22:45:22,873 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 126 [2018-11-18 22:45:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:22,873 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-11-18 22:45:22,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 22:45:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-11-18 22:45:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-18 22:45:22,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:22,874 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:22,874 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:22,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1794474420, now seen corresponding path program 26 times [2018-11-18 22:45:22,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:22,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:22,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:45:22,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:23,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {17625#true} call ULTIMATE.init(); {17625#true} is VALID [2018-11-18 22:45:23,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {17625#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17625#true} is VALID [2018-11-18 22:45:23,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {17625#true} assume true; {17625#true} is VALID [2018-11-18 22:45:23,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17625#true} {17625#true} #66#return; {17625#true} is VALID [2018-11-18 22:45:23,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {17625#true} call #t~ret8 := main(); {17625#true} is VALID [2018-11-18 22:45:23,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {17625#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17627#(= main_~a~0 0)} is VALID [2018-11-18 22:45:23,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {17627#(= main_~a~0 0)} assume true; {17627#(= main_~a~0 0)} is VALID [2018-11-18 22:45:23,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {17627#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17627#(= main_~a~0 0)} is VALID [2018-11-18 22:45:23,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {17627#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17628#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:23,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {17628#(<= main_~a~0 1)} assume true; {17628#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:23,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {17628#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17628#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:23,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {17628#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17629#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:23,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {17629#(<= main_~a~0 2)} assume true; {17629#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:23,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {17629#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17629#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:23,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {17629#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17630#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:23,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {17630#(<= main_~a~0 3)} assume true; {17630#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:23,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {17630#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17630#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:23,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {17630#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17631#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:23,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {17631#(<= main_~a~0 4)} assume true; {17631#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:23,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {17631#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17631#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:23,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {17631#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17632#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:23,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {17632#(<= main_~a~0 5)} assume true; {17632#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:23,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {17632#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17632#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:23,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {17632#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:23,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {17633#(<= main_~a~0 6)} assume true; {17633#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:23,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {17633#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17633#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:23,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {17633#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:23,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {17634#(<= main_~a~0 7)} assume true; {17634#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:23,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {17634#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17634#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:23,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {17634#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:23,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {17635#(<= main_~a~0 8)} assume true; {17635#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:23,394 INFO L273 TraceCheckUtils]: 31: Hoare triple {17635#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17635#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:23,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {17635#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:23,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {17636#(<= main_~a~0 9)} assume true; {17636#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:23,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {17636#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17636#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:23,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {17636#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:23,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {17637#(<= main_~a~0 10)} assume true; {17637#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:23,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {17637#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17637#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:23,399 INFO L273 TraceCheckUtils]: 38: Hoare triple {17637#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:23,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {17638#(<= main_~a~0 11)} assume true; {17638#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:23,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {17638#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17638#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:23,400 INFO L273 TraceCheckUtils]: 41: Hoare triple {17638#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17639#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:23,401 INFO L273 TraceCheckUtils]: 42: Hoare triple {17639#(<= main_~a~0 12)} assume true; {17639#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:23,401 INFO L273 TraceCheckUtils]: 43: Hoare triple {17639#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17639#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:23,402 INFO L273 TraceCheckUtils]: 44: Hoare triple {17639#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17640#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:23,403 INFO L273 TraceCheckUtils]: 45: Hoare triple {17640#(<= main_~a~0 13)} assume true; {17640#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:23,403 INFO L273 TraceCheckUtils]: 46: Hoare triple {17640#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17640#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:23,404 INFO L273 TraceCheckUtils]: 47: Hoare triple {17640#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17641#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:23,404 INFO L273 TraceCheckUtils]: 48: Hoare triple {17641#(<= main_~a~0 14)} assume true; {17641#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:23,405 INFO L273 TraceCheckUtils]: 49: Hoare triple {17641#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17641#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:23,406 INFO L273 TraceCheckUtils]: 50: Hoare triple {17641#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17642#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:23,406 INFO L273 TraceCheckUtils]: 51: Hoare triple {17642#(<= main_~a~0 15)} assume true; {17642#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:23,407 INFO L273 TraceCheckUtils]: 52: Hoare triple {17642#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17642#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:23,407 INFO L273 TraceCheckUtils]: 53: Hoare triple {17642#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17643#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:23,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {17643#(<= main_~a~0 16)} assume true; {17643#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:23,408 INFO L273 TraceCheckUtils]: 55: Hoare triple {17643#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17643#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:23,409 INFO L273 TraceCheckUtils]: 56: Hoare triple {17643#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17644#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:23,410 INFO L273 TraceCheckUtils]: 57: Hoare triple {17644#(<= main_~a~0 17)} assume true; {17644#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:23,410 INFO L273 TraceCheckUtils]: 58: Hoare triple {17644#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17644#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:23,411 INFO L273 TraceCheckUtils]: 59: Hoare triple {17644#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17645#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:23,411 INFO L273 TraceCheckUtils]: 60: Hoare triple {17645#(<= main_~a~0 18)} assume true; {17645#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:23,412 INFO L273 TraceCheckUtils]: 61: Hoare triple {17645#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17645#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:23,413 INFO L273 TraceCheckUtils]: 62: Hoare triple {17645#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17646#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:23,413 INFO L273 TraceCheckUtils]: 63: Hoare triple {17646#(<= main_~a~0 19)} assume true; {17646#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:23,414 INFO L273 TraceCheckUtils]: 64: Hoare triple {17646#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17646#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:23,414 INFO L273 TraceCheckUtils]: 65: Hoare triple {17646#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17647#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:23,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {17647#(<= main_~a~0 20)} assume true; {17647#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:23,415 INFO L273 TraceCheckUtils]: 67: Hoare triple {17647#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17647#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:23,416 INFO L273 TraceCheckUtils]: 68: Hoare triple {17647#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17648#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:23,417 INFO L273 TraceCheckUtils]: 69: Hoare triple {17648#(<= main_~a~0 21)} assume true; {17648#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:23,417 INFO L273 TraceCheckUtils]: 70: Hoare triple {17648#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17648#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:23,418 INFO L273 TraceCheckUtils]: 71: Hoare triple {17648#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17649#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:23,418 INFO L273 TraceCheckUtils]: 72: Hoare triple {17649#(<= main_~a~0 22)} assume true; {17649#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:23,419 INFO L273 TraceCheckUtils]: 73: Hoare triple {17649#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17649#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:23,420 INFO L273 TraceCheckUtils]: 74: Hoare triple {17649#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17650#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:23,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {17650#(<= main_~a~0 23)} assume true; {17650#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:23,421 INFO L273 TraceCheckUtils]: 76: Hoare triple {17650#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17650#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:23,421 INFO L273 TraceCheckUtils]: 77: Hoare triple {17650#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17651#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:23,422 INFO L273 TraceCheckUtils]: 78: Hoare triple {17651#(<= main_~a~0 24)} assume true; {17651#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:23,422 INFO L273 TraceCheckUtils]: 79: Hoare triple {17651#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17651#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:23,423 INFO L273 TraceCheckUtils]: 80: Hoare triple {17651#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17652#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:23,424 INFO L273 TraceCheckUtils]: 81: Hoare triple {17652#(<= main_~a~0 25)} assume true; {17652#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:23,424 INFO L273 TraceCheckUtils]: 82: Hoare triple {17652#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17652#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:23,425 INFO L273 TraceCheckUtils]: 83: Hoare triple {17652#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17653#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:23,425 INFO L273 TraceCheckUtils]: 84: Hoare triple {17653#(<= main_~a~0 26)} assume true; {17653#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:23,426 INFO L273 TraceCheckUtils]: 85: Hoare triple {17653#(<= main_~a~0 26)} assume !(~a~0 < 100000); {17626#false} is VALID [2018-11-18 22:45:23,426 INFO L273 TraceCheckUtils]: 86: Hoare triple {17626#false} havoc ~i~0;~i~0 := 0; {17626#false} is VALID [2018-11-18 22:45:23,426 INFO L273 TraceCheckUtils]: 87: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,427 INFO L273 TraceCheckUtils]: 88: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,427 INFO L273 TraceCheckUtils]: 89: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,427 INFO L273 TraceCheckUtils]: 90: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,427 INFO L273 TraceCheckUtils]: 91: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,427 INFO L273 TraceCheckUtils]: 92: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,427 INFO L273 TraceCheckUtils]: 93: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,428 INFO L273 TraceCheckUtils]: 94: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,428 INFO L273 TraceCheckUtils]: 95: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,428 INFO L273 TraceCheckUtils]: 96: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,428 INFO L273 TraceCheckUtils]: 97: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,428 INFO L273 TraceCheckUtils]: 98: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 99: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 100: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 101: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 102: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 103: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 104: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 105: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 106: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,429 INFO L273 TraceCheckUtils]: 107: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 108: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 109: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 110: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 111: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 112: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 113: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 114: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 115: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 116: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,430 INFO L273 TraceCheckUtils]: 117: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 118: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 119: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 120: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 121: Hoare triple {17626#false} assume !(~i~0 < 100000); {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 122: Hoare triple {17626#false} havoc ~x~0;~x~0 := 0; {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 123: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 124: Hoare triple {17626#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L256 TraceCheckUtils]: 125: Hoare triple {17626#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {17626#false} is VALID [2018-11-18 22:45:23,431 INFO L273 TraceCheckUtils]: 126: Hoare triple {17626#false} ~cond := #in~cond; {17626#false} is VALID [2018-11-18 22:45:23,432 INFO L273 TraceCheckUtils]: 127: Hoare triple {17626#false} assume 0 == ~cond; {17626#false} is VALID [2018-11-18 22:45:23,432 INFO L273 TraceCheckUtils]: 128: Hoare triple {17626#false} assume !false; {17626#false} is VALID [2018-11-18 22:45:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-18 22:45:23,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:23,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:23,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:45:23,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:45:23,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:23,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:23,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {17625#true} call ULTIMATE.init(); {17625#true} is VALID [2018-11-18 22:45:23,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {17625#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17625#true} is VALID [2018-11-18 22:45:23,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {17625#true} assume true; {17625#true} is VALID [2018-11-18 22:45:23,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17625#true} {17625#true} #66#return; {17625#true} is VALID [2018-11-18 22:45:23,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {17625#true} call #t~ret8 := main(); {17625#true} is VALID [2018-11-18 22:45:23,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {17625#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {17672#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:23,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {17672#(<= main_~a~0 0)} assume true; {17672#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:23,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {17672#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17672#(<= main_~a~0 0)} is VALID [2018-11-18 22:45:23,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {17672#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17628#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:23,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {17628#(<= main_~a~0 1)} assume true; {17628#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:23,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {17628#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17628#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:23,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {17628#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17629#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:23,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {17629#(<= main_~a~0 2)} assume true; {17629#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:23,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {17629#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17629#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:23,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {17629#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17630#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:23,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {17630#(<= main_~a~0 3)} assume true; {17630#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:23,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {17630#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17630#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:23,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {17630#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17631#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:23,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {17631#(<= main_~a~0 4)} assume true; {17631#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:23,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {17631#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17631#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:23,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {17631#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17632#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:23,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {17632#(<= main_~a~0 5)} assume true; {17632#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:23,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {17632#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17632#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:23,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {17632#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:23,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {17633#(<= main_~a~0 6)} assume true; {17633#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:23,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {17633#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17633#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:23,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {17633#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:23,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {17634#(<= main_~a~0 7)} assume true; {17634#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:23,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {17634#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17634#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:23,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {17634#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:23,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {17635#(<= main_~a~0 8)} assume true; {17635#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:23,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {17635#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17635#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:23,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {17635#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:23,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {17636#(<= main_~a~0 9)} assume true; {17636#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:23,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {17636#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17636#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:23,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {17636#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:23,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {17637#(<= main_~a~0 10)} assume true; {17637#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:23,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {17637#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17637#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:23,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {17637#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:23,808 INFO L273 TraceCheckUtils]: 39: Hoare triple {17638#(<= main_~a~0 11)} assume true; {17638#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:23,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {17638#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17638#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:23,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {17638#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17639#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:23,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {17639#(<= main_~a~0 12)} assume true; {17639#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:23,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {17639#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17639#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:23,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {17639#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17640#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:23,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {17640#(<= main_~a~0 13)} assume true; {17640#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:23,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {17640#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17640#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:23,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {17640#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17641#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:23,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {17641#(<= main_~a~0 14)} assume true; {17641#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:23,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {17641#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17641#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:23,814 INFO L273 TraceCheckUtils]: 50: Hoare triple {17641#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17642#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:23,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {17642#(<= main_~a~0 15)} assume true; {17642#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:23,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {17642#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17642#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:23,816 INFO L273 TraceCheckUtils]: 53: Hoare triple {17642#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17643#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:23,816 INFO L273 TraceCheckUtils]: 54: Hoare triple {17643#(<= main_~a~0 16)} assume true; {17643#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:23,817 INFO L273 TraceCheckUtils]: 55: Hoare triple {17643#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17643#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:23,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {17643#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17644#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:23,818 INFO L273 TraceCheckUtils]: 57: Hoare triple {17644#(<= main_~a~0 17)} assume true; {17644#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:23,819 INFO L273 TraceCheckUtils]: 58: Hoare triple {17644#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17644#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:23,819 INFO L273 TraceCheckUtils]: 59: Hoare triple {17644#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17645#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:23,820 INFO L273 TraceCheckUtils]: 60: Hoare triple {17645#(<= main_~a~0 18)} assume true; {17645#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:23,820 INFO L273 TraceCheckUtils]: 61: Hoare triple {17645#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17645#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:23,821 INFO L273 TraceCheckUtils]: 62: Hoare triple {17645#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17646#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:23,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {17646#(<= main_~a~0 19)} assume true; {17646#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:23,822 INFO L273 TraceCheckUtils]: 64: Hoare triple {17646#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17646#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:23,823 INFO L273 TraceCheckUtils]: 65: Hoare triple {17646#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17647#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:23,823 INFO L273 TraceCheckUtils]: 66: Hoare triple {17647#(<= main_~a~0 20)} assume true; {17647#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:23,824 INFO L273 TraceCheckUtils]: 67: Hoare triple {17647#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17647#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:23,825 INFO L273 TraceCheckUtils]: 68: Hoare triple {17647#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17648#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:23,825 INFO L273 TraceCheckUtils]: 69: Hoare triple {17648#(<= main_~a~0 21)} assume true; {17648#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:23,826 INFO L273 TraceCheckUtils]: 70: Hoare triple {17648#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17648#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:23,826 INFO L273 TraceCheckUtils]: 71: Hoare triple {17648#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17649#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:23,827 INFO L273 TraceCheckUtils]: 72: Hoare triple {17649#(<= main_~a~0 22)} assume true; {17649#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:23,827 INFO L273 TraceCheckUtils]: 73: Hoare triple {17649#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17649#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:23,828 INFO L273 TraceCheckUtils]: 74: Hoare triple {17649#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17650#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:23,829 INFO L273 TraceCheckUtils]: 75: Hoare triple {17650#(<= main_~a~0 23)} assume true; {17650#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:23,829 INFO L273 TraceCheckUtils]: 76: Hoare triple {17650#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17650#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:23,830 INFO L273 TraceCheckUtils]: 77: Hoare triple {17650#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17651#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:23,830 INFO L273 TraceCheckUtils]: 78: Hoare triple {17651#(<= main_~a~0 24)} assume true; {17651#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:23,831 INFO L273 TraceCheckUtils]: 79: Hoare triple {17651#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17651#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:23,832 INFO L273 TraceCheckUtils]: 80: Hoare triple {17651#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17652#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:23,832 INFO L273 TraceCheckUtils]: 81: Hoare triple {17652#(<= main_~a~0 25)} assume true; {17652#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:23,833 INFO L273 TraceCheckUtils]: 82: Hoare triple {17652#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {17652#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:23,833 INFO L273 TraceCheckUtils]: 83: Hoare triple {17652#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {17653#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:23,834 INFO L273 TraceCheckUtils]: 84: Hoare triple {17653#(<= main_~a~0 26)} assume true; {17653#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:23,835 INFO L273 TraceCheckUtils]: 85: Hoare triple {17653#(<= main_~a~0 26)} assume !(~a~0 < 100000); {17626#false} is VALID [2018-11-18 22:45:23,835 INFO L273 TraceCheckUtils]: 86: Hoare triple {17626#false} havoc ~i~0;~i~0 := 0; {17626#false} is VALID [2018-11-18 22:45:23,835 INFO L273 TraceCheckUtils]: 87: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,835 INFO L273 TraceCheckUtils]: 88: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,835 INFO L273 TraceCheckUtils]: 89: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,836 INFO L273 TraceCheckUtils]: 90: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,836 INFO L273 TraceCheckUtils]: 91: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,836 INFO L273 TraceCheckUtils]: 92: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,836 INFO L273 TraceCheckUtils]: 93: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,836 INFO L273 TraceCheckUtils]: 94: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,836 INFO L273 TraceCheckUtils]: 95: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,837 INFO L273 TraceCheckUtils]: 96: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,837 INFO L273 TraceCheckUtils]: 97: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,837 INFO L273 TraceCheckUtils]: 98: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,837 INFO L273 TraceCheckUtils]: 99: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,837 INFO L273 TraceCheckUtils]: 100: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 101: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 102: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 103: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 104: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 105: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 106: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 107: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 108: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 109: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,838 INFO L273 TraceCheckUtils]: 110: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 111: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 112: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 113: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 114: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 115: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 116: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 117: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 118: Hoare triple {17626#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 119: Hoare triple {17626#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17626#false} is VALID [2018-11-18 22:45:23,839 INFO L273 TraceCheckUtils]: 120: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L273 TraceCheckUtils]: 121: Hoare triple {17626#false} assume !(~i~0 < 100000); {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L273 TraceCheckUtils]: 122: Hoare triple {17626#false} havoc ~x~0;~x~0 := 0; {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L273 TraceCheckUtils]: 123: Hoare triple {17626#false} assume true; {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L273 TraceCheckUtils]: 124: Hoare triple {17626#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L256 TraceCheckUtils]: 125: Hoare triple {17626#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L273 TraceCheckUtils]: 126: Hoare triple {17626#false} ~cond := #in~cond; {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L273 TraceCheckUtils]: 127: Hoare triple {17626#false} assume 0 == ~cond; {17626#false} is VALID [2018-11-18 22:45:23,840 INFO L273 TraceCheckUtils]: 128: Hoare triple {17626#false} assume !false; {17626#false} is VALID [2018-11-18 22:45:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-18 22:45:23,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:23,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-18 22:45:23,869 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 129 [2018-11-18 22:45:23,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:23,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:45:23,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:23,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:45:23,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:45:23,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:45:23,974 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 30 states. [2018-11-18 22:45:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:24,878 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2018-11-18 22:45:24,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 22:45:24,878 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 129 [2018-11-18 22:45:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:45:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 126 transitions. [2018-11-18 22:45:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:45:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 126 transitions. [2018-11-18 22:45:24,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 126 transitions. [2018-11-18 22:45:25,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:25,003 INFO L225 Difference]: With dead ends: 186 [2018-11-18 22:45:25,003 INFO L226 Difference]: Without dead ends: 138 [2018-11-18 22:45:25,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:45:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-18 22:45:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-11-18 22:45:25,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:25,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 137 states. [2018-11-18 22:45:25,057 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 137 states. [2018-11-18 22:45:25,057 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 137 states. [2018-11-18 22:45:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:25,059 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-11-18 22:45:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-11-18 22:45:25,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:25,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:25,060 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 138 states. [2018-11-18 22:45:25,060 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 138 states. [2018-11-18 22:45:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:25,063 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-11-18 22:45:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-11-18 22:45:25,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:25,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:25,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:25,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 22:45:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-11-18 22:45:25,066 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 129 [2018-11-18 22:45:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:25,066 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-11-18 22:45:25,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:45:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-11-18 22:45:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 22:45:25,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:25,068 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:25,068 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:25,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -602538425, now seen corresponding path program 27 times [2018-11-18 22:45:25,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:25,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:25,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:26,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {18749#true} call ULTIMATE.init(); {18749#true} is VALID [2018-11-18 22:45:26,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {18749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18749#true} is VALID [2018-11-18 22:45:26,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:26,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18749#true} {18749#true} #66#return; {18749#true} is VALID [2018-11-18 22:45:26,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {18749#true} call #t~ret8 := main(); {18749#true} is VALID [2018-11-18 22:45:26,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {18749#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {18751#(= main_~a~0 0)} is VALID [2018-11-18 22:45:26,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {18751#(= main_~a~0 0)} assume true; {18751#(= main_~a~0 0)} is VALID [2018-11-18 22:45:26,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {18751#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18751#(= main_~a~0 0)} is VALID [2018-11-18 22:45:26,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {18751#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18752#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:26,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {18752#(<= main_~a~0 1)} assume true; {18752#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:26,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {18752#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18752#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:26,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {18752#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18753#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:26,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {18753#(<= main_~a~0 2)} assume true; {18753#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:26,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {18753#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18753#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:26,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {18753#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18754#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:26,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {18754#(<= main_~a~0 3)} assume true; {18754#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:26,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {18754#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18754#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:26,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {18754#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18755#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:26,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {18755#(<= main_~a~0 4)} assume true; {18755#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:26,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {18755#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18755#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:26,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {18755#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18756#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:26,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {18756#(<= main_~a~0 5)} assume true; {18756#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:26,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {18756#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18756#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:26,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {18756#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18757#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:26,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {18757#(<= main_~a~0 6)} assume true; {18757#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:26,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {18757#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18757#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:26,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {18757#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18758#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:26,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {18758#(<= main_~a~0 7)} assume true; {18758#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:26,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {18758#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18758#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:26,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {18758#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18759#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:26,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {18759#(<= main_~a~0 8)} assume true; {18759#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:26,092 INFO L273 TraceCheckUtils]: 31: Hoare triple {18759#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18759#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:26,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {18759#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18760#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:26,093 INFO L273 TraceCheckUtils]: 33: Hoare triple {18760#(<= main_~a~0 9)} assume true; {18760#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:26,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {18760#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18760#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:26,094 INFO L273 TraceCheckUtils]: 35: Hoare triple {18760#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18761#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:26,095 INFO L273 TraceCheckUtils]: 36: Hoare triple {18761#(<= main_~a~0 10)} assume true; {18761#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:26,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {18761#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18761#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:26,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {18761#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18762#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:26,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {18762#(<= main_~a~0 11)} assume true; {18762#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:26,097 INFO L273 TraceCheckUtils]: 40: Hoare triple {18762#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18762#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:26,098 INFO L273 TraceCheckUtils]: 41: Hoare triple {18762#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18763#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:26,098 INFO L273 TraceCheckUtils]: 42: Hoare triple {18763#(<= main_~a~0 12)} assume true; {18763#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:26,099 INFO L273 TraceCheckUtils]: 43: Hoare triple {18763#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18763#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:26,100 INFO L273 TraceCheckUtils]: 44: Hoare triple {18763#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18764#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:26,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {18764#(<= main_~a~0 13)} assume true; {18764#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:26,101 INFO L273 TraceCheckUtils]: 46: Hoare triple {18764#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18764#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:26,101 INFO L273 TraceCheckUtils]: 47: Hoare triple {18764#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18765#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:26,102 INFO L273 TraceCheckUtils]: 48: Hoare triple {18765#(<= main_~a~0 14)} assume true; {18765#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:26,102 INFO L273 TraceCheckUtils]: 49: Hoare triple {18765#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18765#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:26,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {18765#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18766#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:26,104 INFO L273 TraceCheckUtils]: 51: Hoare triple {18766#(<= main_~a~0 15)} assume true; {18766#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:26,104 INFO L273 TraceCheckUtils]: 52: Hoare triple {18766#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18766#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:26,105 INFO L273 TraceCheckUtils]: 53: Hoare triple {18766#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18767#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:26,105 INFO L273 TraceCheckUtils]: 54: Hoare triple {18767#(<= main_~a~0 16)} assume true; {18767#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:26,106 INFO L273 TraceCheckUtils]: 55: Hoare triple {18767#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18767#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:26,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {18767#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18768#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:26,107 INFO L273 TraceCheckUtils]: 57: Hoare triple {18768#(<= main_~a~0 17)} assume true; {18768#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:26,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {18768#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18768#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:26,108 INFO L273 TraceCheckUtils]: 59: Hoare triple {18768#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18769#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:26,109 INFO L273 TraceCheckUtils]: 60: Hoare triple {18769#(<= main_~a~0 18)} assume true; {18769#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:26,109 INFO L273 TraceCheckUtils]: 61: Hoare triple {18769#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18769#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:26,110 INFO L273 TraceCheckUtils]: 62: Hoare triple {18769#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18770#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:26,111 INFO L273 TraceCheckUtils]: 63: Hoare triple {18770#(<= main_~a~0 19)} assume true; {18770#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:26,111 INFO L273 TraceCheckUtils]: 64: Hoare triple {18770#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18770#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:26,112 INFO L273 TraceCheckUtils]: 65: Hoare triple {18770#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18771#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:26,112 INFO L273 TraceCheckUtils]: 66: Hoare triple {18771#(<= main_~a~0 20)} assume true; {18771#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:26,113 INFO L273 TraceCheckUtils]: 67: Hoare triple {18771#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18771#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:26,114 INFO L273 TraceCheckUtils]: 68: Hoare triple {18771#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18772#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:26,114 INFO L273 TraceCheckUtils]: 69: Hoare triple {18772#(<= main_~a~0 21)} assume true; {18772#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:26,115 INFO L273 TraceCheckUtils]: 70: Hoare triple {18772#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18772#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:26,115 INFO L273 TraceCheckUtils]: 71: Hoare triple {18772#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18773#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:26,116 INFO L273 TraceCheckUtils]: 72: Hoare triple {18773#(<= main_~a~0 22)} assume true; {18773#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:26,116 INFO L273 TraceCheckUtils]: 73: Hoare triple {18773#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18773#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:26,117 INFO L273 TraceCheckUtils]: 74: Hoare triple {18773#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18774#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:26,118 INFO L273 TraceCheckUtils]: 75: Hoare triple {18774#(<= main_~a~0 23)} assume true; {18774#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:26,118 INFO L273 TraceCheckUtils]: 76: Hoare triple {18774#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18774#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:26,119 INFO L273 TraceCheckUtils]: 77: Hoare triple {18774#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18775#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:26,119 INFO L273 TraceCheckUtils]: 78: Hoare triple {18775#(<= main_~a~0 24)} assume true; {18775#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:26,120 INFO L273 TraceCheckUtils]: 79: Hoare triple {18775#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18775#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:26,121 INFO L273 TraceCheckUtils]: 80: Hoare triple {18775#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18776#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:26,121 INFO L273 TraceCheckUtils]: 81: Hoare triple {18776#(<= main_~a~0 25)} assume true; {18776#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:26,122 INFO L273 TraceCheckUtils]: 82: Hoare triple {18776#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18776#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:26,122 INFO L273 TraceCheckUtils]: 83: Hoare triple {18776#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18777#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:26,123 INFO L273 TraceCheckUtils]: 84: Hoare triple {18777#(<= main_~a~0 26)} assume true; {18777#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:26,123 INFO L273 TraceCheckUtils]: 85: Hoare triple {18777#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18777#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:26,124 INFO L273 TraceCheckUtils]: 86: Hoare triple {18777#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18778#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:26,125 INFO L273 TraceCheckUtils]: 87: Hoare triple {18778#(<= main_~a~0 27)} assume true; {18778#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:26,125 INFO L273 TraceCheckUtils]: 88: Hoare triple {18778#(<= main_~a~0 27)} assume !(~a~0 < 100000); {18750#false} is VALID [2018-11-18 22:45:26,125 INFO L273 TraceCheckUtils]: 89: Hoare triple {18750#false} havoc ~i~0;~i~0 := 0; {18750#false} is VALID [2018-11-18 22:45:26,126 INFO L273 TraceCheckUtils]: 90: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,126 INFO L273 TraceCheckUtils]: 91: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,126 INFO L273 TraceCheckUtils]: 92: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,126 INFO L273 TraceCheckUtils]: 93: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,126 INFO L273 TraceCheckUtils]: 94: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,127 INFO L273 TraceCheckUtils]: 95: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,127 INFO L273 TraceCheckUtils]: 96: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,127 INFO L273 TraceCheckUtils]: 97: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,127 INFO L273 TraceCheckUtils]: 98: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,127 INFO L273 TraceCheckUtils]: 99: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,127 INFO L273 TraceCheckUtils]: 100: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,128 INFO L273 TraceCheckUtils]: 101: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,128 INFO L273 TraceCheckUtils]: 102: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,128 INFO L273 TraceCheckUtils]: 103: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,128 INFO L273 TraceCheckUtils]: 104: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,128 INFO L273 TraceCheckUtils]: 105: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 106: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 107: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 108: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 109: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 110: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 111: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 112: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 113: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,129 INFO L273 TraceCheckUtils]: 114: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 115: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 116: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 117: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 118: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 119: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 120: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 121: Hoare triple {18750#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 122: Hoare triple {18750#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18750#false} is VALID [2018-11-18 22:45:26,130 INFO L273 TraceCheckUtils]: 123: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L273 TraceCheckUtils]: 124: Hoare triple {18750#false} assume !(~i~0 < 100000); {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L273 TraceCheckUtils]: 125: Hoare triple {18750#false} havoc ~x~0;~x~0 := 0; {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L273 TraceCheckUtils]: 126: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L273 TraceCheckUtils]: 127: Hoare triple {18750#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L256 TraceCheckUtils]: 128: Hoare triple {18750#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L273 TraceCheckUtils]: 129: Hoare triple {18750#false} ~cond := #in~cond; {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L273 TraceCheckUtils]: 130: Hoare triple {18750#false} assume 0 == ~cond; {18750#false} is VALID [2018-11-18 22:45:26,131 INFO L273 TraceCheckUtils]: 131: Hoare triple {18750#false} assume !false; {18750#false} is VALID [2018-11-18 22:45:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-18 22:45:26,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:26,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:26,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:45:26,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-18 22:45:26,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:26,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:27,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {18749#true} call ULTIMATE.init(); {18749#true} is VALID [2018-11-18 22:45:27,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {18749#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18749#true} is VALID [2018-11-18 22:45:27,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18749#true} {18749#true} #66#return; {18749#true} is VALID [2018-11-18 22:45:27,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {18749#true} call #t~ret8 := main(); {18749#true} is VALID [2018-11-18 22:45:27,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {18749#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {18749#true} is VALID [2018-11-18 22:45:27,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 25: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 41: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 61: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 68: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 69: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 70: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 71: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,215 INFO L273 TraceCheckUtils]: 72: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 74: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 77: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 79: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 80: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 81: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {18749#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {18749#true} is VALID [2018-11-18 22:45:27,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {18749#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {18749#true} is VALID [2018-11-18 22:45:27,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {18749#true} assume true; {18749#true} is VALID [2018-11-18 22:45:27,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {18749#true} assume !(~a~0 < 100000); {18749#true} is VALID [2018-11-18 22:45:27,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {18749#true} havoc ~i~0;~i~0 := 0; {19049#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:27,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {19049#(<= main_~i~0 0)} assume true; {19049#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:27,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {19049#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19049#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:27,219 INFO L273 TraceCheckUtils]: 92: Hoare triple {19049#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19059#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:27,219 INFO L273 TraceCheckUtils]: 93: Hoare triple {19059#(<= main_~i~0 1)} assume true; {19059#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:27,219 INFO L273 TraceCheckUtils]: 94: Hoare triple {19059#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19059#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:27,220 INFO L273 TraceCheckUtils]: 95: Hoare triple {19059#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19069#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:27,220 INFO L273 TraceCheckUtils]: 96: Hoare triple {19069#(<= main_~i~0 2)} assume true; {19069#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:27,221 INFO L273 TraceCheckUtils]: 97: Hoare triple {19069#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19069#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:27,222 INFO L273 TraceCheckUtils]: 98: Hoare triple {19069#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19079#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:27,222 INFO L273 TraceCheckUtils]: 99: Hoare triple {19079#(<= main_~i~0 3)} assume true; {19079#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:27,223 INFO L273 TraceCheckUtils]: 100: Hoare triple {19079#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19079#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:27,223 INFO L273 TraceCheckUtils]: 101: Hoare triple {19079#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19089#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:27,224 INFO L273 TraceCheckUtils]: 102: Hoare triple {19089#(<= main_~i~0 4)} assume true; {19089#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:27,224 INFO L273 TraceCheckUtils]: 103: Hoare triple {19089#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19089#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:27,225 INFO L273 TraceCheckUtils]: 104: Hoare triple {19089#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19099#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:27,226 INFO L273 TraceCheckUtils]: 105: Hoare triple {19099#(<= main_~i~0 5)} assume true; {19099#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:27,226 INFO L273 TraceCheckUtils]: 106: Hoare triple {19099#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19099#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:27,227 INFO L273 TraceCheckUtils]: 107: Hoare triple {19099#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19109#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:27,227 INFO L273 TraceCheckUtils]: 108: Hoare triple {19109#(<= main_~i~0 6)} assume true; {19109#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:27,228 INFO L273 TraceCheckUtils]: 109: Hoare triple {19109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19109#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:27,229 INFO L273 TraceCheckUtils]: 110: Hoare triple {19109#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19119#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:27,229 INFO L273 TraceCheckUtils]: 111: Hoare triple {19119#(<= main_~i~0 7)} assume true; {19119#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:27,230 INFO L273 TraceCheckUtils]: 112: Hoare triple {19119#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19119#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:27,230 INFO L273 TraceCheckUtils]: 113: Hoare triple {19119#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19129#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:27,231 INFO L273 TraceCheckUtils]: 114: Hoare triple {19129#(<= main_~i~0 8)} assume true; {19129#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:27,231 INFO L273 TraceCheckUtils]: 115: Hoare triple {19129#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19129#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:27,232 INFO L273 TraceCheckUtils]: 116: Hoare triple {19129#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19139#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:27,233 INFO L273 TraceCheckUtils]: 117: Hoare triple {19139#(<= main_~i~0 9)} assume true; {19139#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:27,233 INFO L273 TraceCheckUtils]: 118: Hoare triple {19139#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19139#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:27,234 INFO L273 TraceCheckUtils]: 119: Hoare triple {19139#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19149#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:27,234 INFO L273 TraceCheckUtils]: 120: Hoare triple {19149#(<= main_~i~0 10)} assume true; {19149#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:27,235 INFO L273 TraceCheckUtils]: 121: Hoare triple {19149#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19149#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:27,236 INFO L273 TraceCheckUtils]: 122: Hoare triple {19149#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19159#(<= main_~i~0 11)} is VALID [2018-11-18 22:45:27,236 INFO L273 TraceCheckUtils]: 123: Hoare triple {19159#(<= main_~i~0 11)} assume true; {19159#(<= main_~i~0 11)} is VALID [2018-11-18 22:45:27,237 INFO L273 TraceCheckUtils]: 124: Hoare triple {19159#(<= main_~i~0 11)} assume !(~i~0 < 100000); {18750#false} is VALID [2018-11-18 22:45:27,237 INFO L273 TraceCheckUtils]: 125: Hoare triple {18750#false} havoc ~x~0;~x~0 := 0; {18750#false} is VALID [2018-11-18 22:45:27,237 INFO L273 TraceCheckUtils]: 126: Hoare triple {18750#false} assume true; {18750#false} is VALID [2018-11-18 22:45:27,237 INFO L273 TraceCheckUtils]: 127: Hoare triple {18750#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {18750#false} is VALID [2018-11-18 22:45:27,237 INFO L256 TraceCheckUtils]: 128: Hoare triple {18750#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {18750#false} is VALID [2018-11-18 22:45:27,238 INFO L273 TraceCheckUtils]: 129: Hoare triple {18750#false} ~cond := #in~cond; {18750#false} is VALID [2018-11-18 22:45:27,238 INFO L273 TraceCheckUtils]: 130: Hoare triple {18750#false} assume 0 == ~cond; {18750#false} is VALID [2018-11-18 22:45:27,238 INFO L273 TraceCheckUtils]: 131: Hoare triple {18750#false} assume !false; {18750#false} is VALID [2018-11-18 22:45:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-11-18 22:45:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:27,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 14] total 42 [2018-11-18 22:45:27,267 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 132 [2018-11-18 22:45:27,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:27,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-18 22:45:27,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:27,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-18 22:45:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-18 22:45:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1197, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 22:45:27,540 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 42 states. [2018-11-18 22:45:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:28,642 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2018-11-18 22:45:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 22:45:28,642 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 132 [2018-11-18 22:45:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:45:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 166 transitions. [2018-11-18 22:45:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:45:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 166 transitions. [2018-11-18 22:45:28,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 166 transitions. [2018-11-18 22:45:28,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:28,804 INFO L225 Difference]: With dead ends: 193 [2018-11-18 22:45:28,804 INFO L226 Difference]: Without dead ends: 145 [2018-11-18 22:45:28,805 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=525, Invalid=1197, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 22:45:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-18 22:45:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-18 22:45:28,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:28,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-18 22:45:28,856 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-18 22:45:28,856 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-18 22:45:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:28,859 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-11-18 22:45:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-11-18 22:45:28,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:28,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:28,859 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-18 22:45:28,859 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-18 22:45:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:28,861 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-11-18 22:45:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-11-18 22:45:28,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:28,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:28,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:28,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 22:45:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-11-18 22:45:28,864 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 132 [2018-11-18 22:45:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:28,864 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-11-18 22:45:28,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-18 22:45:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-11-18 22:45:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-18 22:45:28,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:28,865 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:28,865 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:28,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:28,866 INFO L82 PathProgramCache]: Analyzing trace with hash -316890806, now seen corresponding path program 28 times [2018-11-18 22:45:28,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:28,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:28,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:30,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {19925#true} call ULTIMATE.init(); {19925#true} is VALID [2018-11-18 22:45:30,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {19925#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19925#true} is VALID [2018-11-18 22:45:30,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:30,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19925#true} {19925#true} #66#return; {19925#true} is VALID [2018-11-18 22:45:30,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {19925#true} call #t~ret8 := main(); {19925#true} is VALID [2018-11-18 22:45:30,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {19925#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {19927#(= main_~a~0 0)} is VALID [2018-11-18 22:45:30,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {19927#(= main_~a~0 0)} assume true; {19927#(= main_~a~0 0)} is VALID [2018-11-18 22:45:30,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {19927#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19927#(= main_~a~0 0)} is VALID [2018-11-18 22:45:30,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {19927#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19928#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:30,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {19928#(<= main_~a~0 1)} assume true; {19928#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:30,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {19928#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19928#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:30,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {19928#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19929#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:30,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {19929#(<= main_~a~0 2)} assume true; {19929#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:30,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {19929#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19929#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:30,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {19929#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19930#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:30,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {19930#(<= main_~a~0 3)} assume true; {19930#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:30,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {19930#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19930#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:30,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {19930#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19931#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:30,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {19931#(<= main_~a~0 4)} assume true; {19931#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:30,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {19931#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19931#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:30,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {19931#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19932#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:30,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {19932#(<= main_~a~0 5)} assume true; {19932#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:30,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {19932#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19932#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:30,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {19932#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19933#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:30,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {19933#(<= main_~a~0 6)} assume true; {19933#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:30,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {19933#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19933#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:30,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {19933#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19934#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:30,136 INFO L273 TraceCheckUtils]: 27: Hoare triple {19934#(<= main_~a~0 7)} assume true; {19934#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:30,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {19934#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19934#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:30,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {19934#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19935#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:30,138 INFO L273 TraceCheckUtils]: 30: Hoare triple {19935#(<= main_~a~0 8)} assume true; {19935#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:30,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {19935#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19935#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:30,139 INFO L273 TraceCheckUtils]: 32: Hoare triple {19935#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19936#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:30,140 INFO L273 TraceCheckUtils]: 33: Hoare triple {19936#(<= main_~a~0 9)} assume true; {19936#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:30,140 INFO L273 TraceCheckUtils]: 34: Hoare triple {19936#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19936#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:30,141 INFO L273 TraceCheckUtils]: 35: Hoare triple {19936#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19937#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:30,142 INFO L273 TraceCheckUtils]: 36: Hoare triple {19937#(<= main_~a~0 10)} assume true; {19937#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:30,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {19937#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19937#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:30,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {19937#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19938#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:30,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {19938#(<= main_~a~0 11)} assume true; {19938#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:30,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {19938#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19938#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:30,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {19938#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19939#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:30,145 INFO L273 TraceCheckUtils]: 42: Hoare triple {19939#(<= main_~a~0 12)} assume true; {19939#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:30,163 INFO L273 TraceCheckUtils]: 43: Hoare triple {19939#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19939#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:30,165 INFO L273 TraceCheckUtils]: 44: Hoare triple {19939#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19940#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:30,166 INFO L273 TraceCheckUtils]: 45: Hoare triple {19940#(<= main_~a~0 13)} assume true; {19940#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:30,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {19940#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19940#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:30,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {19940#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19941#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:30,167 INFO L273 TraceCheckUtils]: 48: Hoare triple {19941#(<= main_~a~0 14)} assume true; {19941#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:30,167 INFO L273 TraceCheckUtils]: 49: Hoare triple {19941#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19941#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:30,167 INFO L273 TraceCheckUtils]: 50: Hoare triple {19941#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19942#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:30,168 INFO L273 TraceCheckUtils]: 51: Hoare triple {19942#(<= main_~a~0 15)} assume true; {19942#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:30,168 INFO L273 TraceCheckUtils]: 52: Hoare triple {19942#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19942#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:30,169 INFO L273 TraceCheckUtils]: 53: Hoare triple {19942#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19943#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:30,169 INFO L273 TraceCheckUtils]: 54: Hoare triple {19943#(<= main_~a~0 16)} assume true; {19943#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:30,170 INFO L273 TraceCheckUtils]: 55: Hoare triple {19943#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19943#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:30,170 INFO L273 TraceCheckUtils]: 56: Hoare triple {19943#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19944#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:30,171 INFO L273 TraceCheckUtils]: 57: Hoare triple {19944#(<= main_~a~0 17)} assume true; {19944#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:30,171 INFO L273 TraceCheckUtils]: 58: Hoare triple {19944#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19944#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:30,172 INFO L273 TraceCheckUtils]: 59: Hoare triple {19944#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19945#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:30,173 INFO L273 TraceCheckUtils]: 60: Hoare triple {19945#(<= main_~a~0 18)} assume true; {19945#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:30,173 INFO L273 TraceCheckUtils]: 61: Hoare triple {19945#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19945#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:30,174 INFO L273 TraceCheckUtils]: 62: Hoare triple {19945#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19946#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:30,174 INFO L273 TraceCheckUtils]: 63: Hoare triple {19946#(<= main_~a~0 19)} assume true; {19946#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:30,175 INFO L273 TraceCheckUtils]: 64: Hoare triple {19946#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19946#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:30,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {19946#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19947#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:30,176 INFO L273 TraceCheckUtils]: 66: Hoare triple {19947#(<= main_~a~0 20)} assume true; {19947#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:30,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {19947#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19947#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:30,177 INFO L273 TraceCheckUtils]: 68: Hoare triple {19947#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19948#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:30,178 INFO L273 TraceCheckUtils]: 69: Hoare triple {19948#(<= main_~a~0 21)} assume true; {19948#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:30,178 INFO L273 TraceCheckUtils]: 70: Hoare triple {19948#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19948#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:30,179 INFO L273 TraceCheckUtils]: 71: Hoare triple {19948#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19949#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:30,180 INFO L273 TraceCheckUtils]: 72: Hoare triple {19949#(<= main_~a~0 22)} assume true; {19949#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:30,180 INFO L273 TraceCheckUtils]: 73: Hoare triple {19949#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19949#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:30,181 INFO L273 TraceCheckUtils]: 74: Hoare triple {19949#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19950#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:30,181 INFO L273 TraceCheckUtils]: 75: Hoare triple {19950#(<= main_~a~0 23)} assume true; {19950#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:30,182 INFO L273 TraceCheckUtils]: 76: Hoare triple {19950#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19950#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:30,183 INFO L273 TraceCheckUtils]: 77: Hoare triple {19950#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19951#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:30,183 INFO L273 TraceCheckUtils]: 78: Hoare triple {19951#(<= main_~a~0 24)} assume true; {19951#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:30,184 INFO L273 TraceCheckUtils]: 79: Hoare triple {19951#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19951#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:30,184 INFO L273 TraceCheckUtils]: 80: Hoare triple {19951#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19952#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:30,185 INFO L273 TraceCheckUtils]: 81: Hoare triple {19952#(<= main_~a~0 25)} assume true; {19952#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:30,185 INFO L273 TraceCheckUtils]: 82: Hoare triple {19952#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19952#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:30,186 INFO L273 TraceCheckUtils]: 83: Hoare triple {19952#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19953#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:30,187 INFO L273 TraceCheckUtils]: 84: Hoare triple {19953#(<= main_~a~0 26)} assume true; {19953#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:30,187 INFO L273 TraceCheckUtils]: 85: Hoare triple {19953#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19953#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:30,188 INFO L273 TraceCheckUtils]: 86: Hoare triple {19953#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19954#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:30,188 INFO L273 TraceCheckUtils]: 87: Hoare triple {19954#(<= main_~a~0 27)} assume true; {19954#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:30,189 INFO L273 TraceCheckUtils]: 88: Hoare triple {19954#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19954#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:30,190 INFO L273 TraceCheckUtils]: 89: Hoare triple {19954#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19955#(<= main_~a~0 28)} is VALID [2018-11-18 22:45:30,190 INFO L273 TraceCheckUtils]: 90: Hoare triple {19955#(<= main_~a~0 28)} assume true; {19955#(<= main_~a~0 28)} is VALID [2018-11-18 22:45:30,191 INFO L273 TraceCheckUtils]: 91: Hoare triple {19955#(<= main_~a~0 28)} assume !(~a~0 < 100000); {19926#false} is VALID [2018-11-18 22:45:30,191 INFO L273 TraceCheckUtils]: 92: Hoare triple {19926#false} havoc ~i~0;~i~0 := 0; {19926#false} is VALID [2018-11-18 22:45:30,191 INFO L273 TraceCheckUtils]: 93: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,191 INFO L273 TraceCheckUtils]: 94: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,192 INFO L273 TraceCheckUtils]: 95: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,192 INFO L273 TraceCheckUtils]: 96: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,192 INFO L273 TraceCheckUtils]: 97: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,192 INFO L273 TraceCheckUtils]: 98: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,192 INFO L273 TraceCheckUtils]: 99: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,192 INFO L273 TraceCheckUtils]: 100: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,193 INFO L273 TraceCheckUtils]: 101: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,193 INFO L273 TraceCheckUtils]: 102: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,193 INFO L273 TraceCheckUtils]: 103: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,193 INFO L273 TraceCheckUtils]: 104: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,193 INFO L273 TraceCheckUtils]: 105: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 106: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 107: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 108: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 109: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 110: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 111: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 112: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 113: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 114: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,194 INFO L273 TraceCheckUtils]: 115: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 116: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 117: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 118: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 119: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 120: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 121: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 122: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 123: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 124: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,195 INFO L273 TraceCheckUtils]: 125: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 126: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 127: Hoare triple {19926#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 128: Hoare triple {19926#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 129: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 130: Hoare triple {19926#false} assume !(~i~0 < 100000); {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 131: Hoare triple {19926#false} havoc ~x~0;~x~0 := 0; {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 132: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L273 TraceCheckUtils]: 133: Hoare triple {19926#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {19926#false} is VALID [2018-11-18 22:45:30,196 INFO L256 TraceCheckUtils]: 134: Hoare triple {19926#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {19926#false} is VALID [2018-11-18 22:45:30,197 INFO L273 TraceCheckUtils]: 135: Hoare triple {19926#false} ~cond := #in~cond; {19926#false} is VALID [2018-11-18 22:45:30,197 INFO L273 TraceCheckUtils]: 136: Hoare triple {19926#false} assume 0 == ~cond; {19926#false} is VALID [2018-11-18 22:45:30,197 INFO L273 TraceCheckUtils]: 137: Hoare triple {19926#false} assume !false; {19926#false} is VALID [2018-11-18 22:45:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-18 22:45:30,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:30,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:45:30,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:45:30,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:45:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:30,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:45:31,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {19925#true} call ULTIMATE.init(); {19925#true} is VALID [2018-11-18 22:45:31,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {19925#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19925#true} is VALID [2018-11-18 22:45:31,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19925#true} {19925#true} #66#return; {19925#true} is VALID [2018-11-18 22:45:31,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {19925#true} call #t~ret8 := main(); {19925#true} is VALID [2018-11-18 22:45:31,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {19925#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {19925#true} is VALID [2018-11-18 22:45:31,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 35: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 36: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 39: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 41: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 42: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 43: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 45: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 47: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 50: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 51: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 53: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,643 INFO L273 TraceCheckUtils]: 56: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 58: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 61: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 62: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 63: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 64: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,644 INFO L273 TraceCheckUtils]: 65: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 66: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 67: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 68: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 69: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 71: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 72: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 73: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 74: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,645 INFO L273 TraceCheckUtils]: 75: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 76: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 78: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 79: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 80: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 81: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 82: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 83: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 84: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,646 INFO L273 TraceCheckUtils]: 85: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,647 INFO L273 TraceCheckUtils]: 86: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,647 INFO L273 TraceCheckUtils]: 87: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,647 INFO L273 TraceCheckUtils]: 88: Hoare triple {19925#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {19925#true} is VALID [2018-11-18 22:45:31,647 INFO L273 TraceCheckUtils]: 89: Hoare triple {19925#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {19925#true} is VALID [2018-11-18 22:45:31,647 INFO L273 TraceCheckUtils]: 90: Hoare triple {19925#true} assume true; {19925#true} is VALID [2018-11-18 22:45:31,647 INFO L273 TraceCheckUtils]: 91: Hoare triple {19925#true} assume !(~a~0 < 100000); {19925#true} is VALID [2018-11-18 22:45:31,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {19925#true} havoc ~i~0;~i~0 := 0; {20235#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:31,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {20235#(<= main_~i~0 0)} assume true; {20235#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:31,648 INFO L273 TraceCheckUtils]: 94: Hoare triple {20235#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20235#(<= main_~i~0 0)} is VALID [2018-11-18 22:45:31,649 INFO L273 TraceCheckUtils]: 95: Hoare triple {20235#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20245#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:31,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {20245#(<= main_~i~0 1)} assume true; {20245#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:31,649 INFO L273 TraceCheckUtils]: 97: Hoare triple {20245#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20245#(<= main_~i~0 1)} is VALID [2018-11-18 22:45:31,650 INFO L273 TraceCheckUtils]: 98: Hoare triple {20245#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20255#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:31,651 INFO L273 TraceCheckUtils]: 99: Hoare triple {20255#(<= main_~i~0 2)} assume true; {20255#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:31,651 INFO L273 TraceCheckUtils]: 100: Hoare triple {20255#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20255#(<= main_~i~0 2)} is VALID [2018-11-18 22:45:31,652 INFO L273 TraceCheckUtils]: 101: Hoare triple {20255#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20265#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:31,652 INFO L273 TraceCheckUtils]: 102: Hoare triple {20265#(<= main_~i~0 3)} assume true; {20265#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:31,653 INFO L273 TraceCheckUtils]: 103: Hoare triple {20265#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20265#(<= main_~i~0 3)} is VALID [2018-11-18 22:45:31,654 INFO L273 TraceCheckUtils]: 104: Hoare triple {20265#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20275#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:31,654 INFO L273 TraceCheckUtils]: 105: Hoare triple {20275#(<= main_~i~0 4)} assume true; {20275#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:31,655 INFO L273 TraceCheckUtils]: 106: Hoare triple {20275#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20275#(<= main_~i~0 4)} is VALID [2018-11-18 22:45:31,655 INFO L273 TraceCheckUtils]: 107: Hoare triple {20275#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20285#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:31,656 INFO L273 TraceCheckUtils]: 108: Hoare triple {20285#(<= main_~i~0 5)} assume true; {20285#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:31,656 INFO L273 TraceCheckUtils]: 109: Hoare triple {20285#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20285#(<= main_~i~0 5)} is VALID [2018-11-18 22:45:31,657 INFO L273 TraceCheckUtils]: 110: Hoare triple {20285#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20295#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:31,658 INFO L273 TraceCheckUtils]: 111: Hoare triple {20295#(<= main_~i~0 6)} assume true; {20295#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:31,658 INFO L273 TraceCheckUtils]: 112: Hoare triple {20295#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20295#(<= main_~i~0 6)} is VALID [2018-11-18 22:45:31,659 INFO L273 TraceCheckUtils]: 113: Hoare triple {20295#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20305#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:31,659 INFO L273 TraceCheckUtils]: 114: Hoare triple {20305#(<= main_~i~0 7)} assume true; {20305#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:31,660 INFO L273 TraceCheckUtils]: 115: Hoare triple {20305#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20305#(<= main_~i~0 7)} is VALID [2018-11-18 22:45:31,661 INFO L273 TraceCheckUtils]: 116: Hoare triple {20305#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20315#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:31,661 INFO L273 TraceCheckUtils]: 117: Hoare triple {20315#(<= main_~i~0 8)} assume true; {20315#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:31,662 INFO L273 TraceCheckUtils]: 118: Hoare triple {20315#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20315#(<= main_~i~0 8)} is VALID [2018-11-18 22:45:31,662 INFO L273 TraceCheckUtils]: 119: Hoare triple {20315#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20325#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:31,663 INFO L273 TraceCheckUtils]: 120: Hoare triple {20325#(<= main_~i~0 9)} assume true; {20325#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:31,663 INFO L273 TraceCheckUtils]: 121: Hoare triple {20325#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20325#(<= main_~i~0 9)} is VALID [2018-11-18 22:45:31,664 INFO L273 TraceCheckUtils]: 122: Hoare triple {20325#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20335#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:31,665 INFO L273 TraceCheckUtils]: 123: Hoare triple {20335#(<= main_~i~0 10)} assume true; {20335#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:31,665 INFO L273 TraceCheckUtils]: 124: Hoare triple {20335#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20335#(<= main_~i~0 10)} is VALID [2018-11-18 22:45:31,666 INFO L273 TraceCheckUtils]: 125: Hoare triple {20335#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20345#(<= main_~i~0 11)} is VALID [2018-11-18 22:45:31,666 INFO L273 TraceCheckUtils]: 126: Hoare triple {20345#(<= main_~i~0 11)} assume true; {20345#(<= main_~i~0 11)} is VALID [2018-11-18 22:45:31,667 INFO L273 TraceCheckUtils]: 127: Hoare triple {20345#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {20345#(<= main_~i~0 11)} is VALID [2018-11-18 22:45:31,668 INFO L273 TraceCheckUtils]: 128: Hoare triple {20345#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20355#(<= main_~i~0 12)} is VALID [2018-11-18 22:45:31,668 INFO L273 TraceCheckUtils]: 129: Hoare triple {20355#(<= main_~i~0 12)} assume true; {20355#(<= main_~i~0 12)} is VALID [2018-11-18 22:45:31,669 INFO L273 TraceCheckUtils]: 130: Hoare triple {20355#(<= main_~i~0 12)} assume !(~i~0 < 100000); {19926#false} is VALID [2018-11-18 22:45:31,669 INFO L273 TraceCheckUtils]: 131: Hoare triple {19926#false} havoc ~x~0;~x~0 := 0; {19926#false} is VALID [2018-11-18 22:45:31,669 INFO L273 TraceCheckUtils]: 132: Hoare triple {19926#false} assume true; {19926#false} is VALID [2018-11-18 22:45:31,669 INFO L273 TraceCheckUtils]: 133: Hoare triple {19926#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {19926#false} is VALID [2018-11-18 22:45:31,670 INFO L256 TraceCheckUtils]: 134: Hoare triple {19926#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {19926#false} is VALID [2018-11-18 22:45:31,670 INFO L273 TraceCheckUtils]: 135: Hoare triple {19926#false} ~cond := #in~cond; {19926#false} is VALID [2018-11-18 22:45:31,670 INFO L273 TraceCheckUtils]: 136: Hoare triple {19926#false} assume 0 == ~cond; {19926#false} is VALID [2018-11-18 22:45:31,670 INFO L273 TraceCheckUtils]: 137: Hoare triple {19926#false} assume !false; {19926#false} is VALID [2018-11-18 22:45:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-11-18 22:45:31,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:45:31,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 15] total 44 [2018-11-18 22:45:31,700 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 138 [2018-11-18 22:45:31,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:45:31,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-18 22:45:31,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:31,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-18 22:45:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-18 22:45:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=1323, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 22:45:31,844 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 44 states. [2018-11-18 22:45:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:32,707 INFO L93 Difference]: Finished difference Result 202 states and 207 transitions. [2018-11-18 22:45:32,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 22:45:32,707 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 138 [2018-11-18 22:45:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:45:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:45:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 172 transitions. [2018-11-18 22:45:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 22:45:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 172 transitions. [2018-11-18 22:45:32,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 172 transitions. [2018-11-18 22:45:32,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:45:32,915 INFO L225 Difference]: With dead ends: 202 [2018-11-18 22:45:32,916 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 22:45:32,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=569, Invalid=1323, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 22:45:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 22:45:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-18 22:45:32,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:45:32,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 149 states. [2018-11-18 22:45:32,954 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 149 states. [2018-11-18 22:45:32,954 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 149 states. [2018-11-18 22:45:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:32,956 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-11-18 22:45:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-11-18 22:45:32,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:32,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:32,957 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 151 states. [2018-11-18 22:45:32,957 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 151 states. [2018-11-18 22:45:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:45:32,959 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-11-18 22:45:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-11-18 22:45:32,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:45:32,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:45:32,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:45:32,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:45:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 22:45:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-11-18 22:45:32,962 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 138 [2018-11-18 22:45:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:45:32,962 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-11-18 22:45:32,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-18 22:45:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-11-18 22:45:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 22:45:32,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:45:32,963 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:45:32,963 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:45:32,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:45:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2118089945, now seen corresponding path program 29 times [2018-11-18 22:45:32,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:45:32,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:45:32,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:32,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:45:32,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:45:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:45:33,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {21153#true} call ULTIMATE.init(); {21153#true} is VALID [2018-11-18 22:45:33,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {21153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21153#true} is VALID [2018-11-18 22:45:33,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:45:33,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21153#true} {21153#true} #66#return; {21153#true} is VALID [2018-11-18 22:45:33,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {21153#true} call #t~ret8 := main(); {21153#true} is VALID [2018-11-18 22:45:33,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {21153#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {21155#(= main_~a~0 0)} is VALID [2018-11-18 22:45:33,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {21155#(= main_~a~0 0)} assume true; {21155#(= main_~a~0 0)} is VALID [2018-11-18 22:45:33,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {21155#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21155#(= main_~a~0 0)} is VALID [2018-11-18 22:45:33,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {21155#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21156#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:33,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {21156#(<= main_~a~0 1)} assume true; {21156#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:33,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {21156#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21156#(<= main_~a~0 1)} is VALID [2018-11-18 22:45:33,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {21156#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21157#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:33,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {21157#(<= main_~a~0 2)} assume true; {21157#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:33,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {21157#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21157#(<= main_~a~0 2)} is VALID [2018-11-18 22:45:33,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {21157#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21158#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:33,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {21158#(<= main_~a~0 3)} assume true; {21158#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:33,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {21158#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21158#(<= main_~a~0 3)} is VALID [2018-11-18 22:45:33,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {21158#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21159#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:33,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {21159#(<= main_~a~0 4)} assume true; {21159#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:33,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {21159#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21159#(<= main_~a~0 4)} is VALID [2018-11-18 22:45:33,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {21159#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21160#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:33,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {21160#(<= main_~a~0 5)} assume true; {21160#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:33,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {21160#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21160#(<= main_~a~0 5)} is VALID [2018-11-18 22:45:33,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {21160#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21161#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:33,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {21161#(<= main_~a~0 6)} assume true; {21161#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:33,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {21161#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21161#(<= main_~a~0 6)} is VALID [2018-11-18 22:45:33,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {21161#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21162#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:33,691 INFO L273 TraceCheckUtils]: 27: Hoare triple {21162#(<= main_~a~0 7)} assume true; {21162#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:33,691 INFO L273 TraceCheckUtils]: 28: Hoare triple {21162#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21162#(<= main_~a~0 7)} is VALID [2018-11-18 22:45:33,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {21162#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21163#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:33,692 INFO L273 TraceCheckUtils]: 30: Hoare triple {21163#(<= main_~a~0 8)} assume true; {21163#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:33,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {21163#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21163#(<= main_~a~0 8)} is VALID [2018-11-18 22:45:33,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {21163#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21164#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:33,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {21164#(<= main_~a~0 9)} assume true; {21164#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:33,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {21164#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21164#(<= main_~a~0 9)} is VALID [2018-11-18 22:45:33,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {21164#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21165#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:33,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {21165#(<= main_~a~0 10)} assume true; {21165#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:33,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {21165#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21165#(<= main_~a~0 10)} is VALID [2018-11-18 22:45:33,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {21165#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21166#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:33,698 INFO L273 TraceCheckUtils]: 39: Hoare triple {21166#(<= main_~a~0 11)} assume true; {21166#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:33,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {21166#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21166#(<= main_~a~0 11)} is VALID [2018-11-18 22:45:33,699 INFO L273 TraceCheckUtils]: 41: Hoare triple {21166#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21167#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:33,699 INFO L273 TraceCheckUtils]: 42: Hoare triple {21167#(<= main_~a~0 12)} assume true; {21167#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:33,700 INFO L273 TraceCheckUtils]: 43: Hoare triple {21167#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21167#(<= main_~a~0 12)} is VALID [2018-11-18 22:45:33,701 INFO L273 TraceCheckUtils]: 44: Hoare triple {21167#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21168#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:33,701 INFO L273 TraceCheckUtils]: 45: Hoare triple {21168#(<= main_~a~0 13)} assume true; {21168#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:33,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {21168#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21168#(<= main_~a~0 13)} is VALID [2018-11-18 22:45:33,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {21168#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21169#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:33,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {21169#(<= main_~a~0 14)} assume true; {21169#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:33,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {21169#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21169#(<= main_~a~0 14)} is VALID [2018-11-18 22:45:33,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {21169#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21170#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:33,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {21170#(<= main_~a~0 15)} assume true; {21170#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:33,705 INFO L273 TraceCheckUtils]: 52: Hoare triple {21170#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21170#(<= main_~a~0 15)} is VALID [2018-11-18 22:45:33,706 INFO L273 TraceCheckUtils]: 53: Hoare triple {21170#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21171#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:33,706 INFO L273 TraceCheckUtils]: 54: Hoare triple {21171#(<= main_~a~0 16)} assume true; {21171#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:33,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {21171#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21171#(<= main_~a~0 16)} is VALID [2018-11-18 22:45:33,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {21171#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21172#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:33,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {21172#(<= main_~a~0 17)} assume true; {21172#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:33,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {21172#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21172#(<= main_~a~0 17)} is VALID [2018-11-18 22:45:33,709 INFO L273 TraceCheckUtils]: 59: Hoare triple {21172#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21173#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:33,709 INFO L273 TraceCheckUtils]: 60: Hoare triple {21173#(<= main_~a~0 18)} assume true; {21173#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:33,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {21173#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21173#(<= main_~a~0 18)} is VALID [2018-11-18 22:45:33,710 INFO L273 TraceCheckUtils]: 62: Hoare triple {21173#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21174#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:33,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {21174#(<= main_~a~0 19)} assume true; {21174#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:33,711 INFO L273 TraceCheckUtils]: 64: Hoare triple {21174#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21174#(<= main_~a~0 19)} is VALID [2018-11-18 22:45:33,712 INFO L273 TraceCheckUtils]: 65: Hoare triple {21174#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21175#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:33,713 INFO L273 TraceCheckUtils]: 66: Hoare triple {21175#(<= main_~a~0 20)} assume true; {21175#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:33,713 INFO L273 TraceCheckUtils]: 67: Hoare triple {21175#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21175#(<= main_~a~0 20)} is VALID [2018-11-18 22:45:33,714 INFO L273 TraceCheckUtils]: 68: Hoare triple {21175#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21176#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:33,714 INFO L273 TraceCheckUtils]: 69: Hoare triple {21176#(<= main_~a~0 21)} assume true; {21176#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:33,715 INFO L273 TraceCheckUtils]: 70: Hoare triple {21176#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21176#(<= main_~a~0 21)} is VALID [2018-11-18 22:45:33,715 INFO L273 TraceCheckUtils]: 71: Hoare triple {21176#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21177#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:33,716 INFO L273 TraceCheckUtils]: 72: Hoare triple {21177#(<= main_~a~0 22)} assume true; {21177#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:33,716 INFO L273 TraceCheckUtils]: 73: Hoare triple {21177#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21177#(<= main_~a~0 22)} is VALID [2018-11-18 22:45:33,717 INFO L273 TraceCheckUtils]: 74: Hoare triple {21177#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21178#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:33,718 INFO L273 TraceCheckUtils]: 75: Hoare triple {21178#(<= main_~a~0 23)} assume true; {21178#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:33,718 INFO L273 TraceCheckUtils]: 76: Hoare triple {21178#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21178#(<= main_~a~0 23)} is VALID [2018-11-18 22:45:33,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {21178#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21179#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:33,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {21179#(<= main_~a~0 24)} assume true; {21179#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:33,720 INFO L273 TraceCheckUtils]: 79: Hoare triple {21179#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21179#(<= main_~a~0 24)} is VALID [2018-11-18 22:45:33,720 INFO L273 TraceCheckUtils]: 80: Hoare triple {21179#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21180#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:33,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {21180#(<= main_~a~0 25)} assume true; {21180#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:33,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {21180#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21180#(<= main_~a~0 25)} is VALID [2018-11-18 22:45:33,722 INFO L273 TraceCheckUtils]: 83: Hoare triple {21180#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21181#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:33,723 INFO L273 TraceCheckUtils]: 84: Hoare triple {21181#(<= main_~a~0 26)} assume true; {21181#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:33,723 INFO L273 TraceCheckUtils]: 85: Hoare triple {21181#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21181#(<= main_~a~0 26)} is VALID [2018-11-18 22:45:33,724 INFO L273 TraceCheckUtils]: 86: Hoare triple {21181#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21182#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:33,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {21182#(<= main_~a~0 27)} assume true; {21182#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:33,725 INFO L273 TraceCheckUtils]: 88: Hoare triple {21182#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21182#(<= main_~a~0 27)} is VALID [2018-11-18 22:45:33,725 INFO L273 TraceCheckUtils]: 89: Hoare triple {21182#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21183#(<= main_~a~0 28)} is VALID [2018-11-18 22:45:33,726 INFO L273 TraceCheckUtils]: 90: Hoare triple {21183#(<= main_~a~0 28)} assume true; {21183#(<= main_~a~0 28)} is VALID [2018-11-18 22:45:33,726 INFO L273 TraceCheckUtils]: 91: Hoare triple {21183#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21183#(<= main_~a~0 28)} is VALID [2018-11-18 22:45:33,727 INFO L273 TraceCheckUtils]: 92: Hoare triple {21183#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21184#(<= main_~a~0 29)} is VALID [2018-11-18 22:45:33,728 INFO L273 TraceCheckUtils]: 93: Hoare triple {21184#(<= main_~a~0 29)} assume true; {21184#(<= main_~a~0 29)} is VALID [2018-11-18 22:45:33,728 INFO L273 TraceCheckUtils]: 94: Hoare triple {21184#(<= main_~a~0 29)} assume !(~a~0 < 100000); {21154#false} is VALID [2018-11-18 22:45:33,728 INFO L273 TraceCheckUtils]: 95: Hoare triple {21154#false} havoc ~i~0;~i~0 := 0; {21154#false} is VALID [2018-11-18 22:45:33,729 INFO L273 TraceCheckUtils]: 96: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,729 INFO L273 TraceCheckUtils]: 97: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,729 INFO L273 TraceCheckUtils]: 98: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,729 INFO L273 TraceCheckUtils]: 99: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,729 INFO L273 TraceCheckUtils]: 100: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,730 INFO L273 TraceCheckUtils]: 101: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,730 INFO L273 TraceCheckUtils]: 102: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,730 INFO L273 TraceCheckUtils]: 103: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,730 INFO L273 TraceCheckUtils]: 104: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,730 INFO L273 TraceCheckUtils]: 105: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,730 INFO L273 TraceCheckUtils]: 106: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,730 INFO L273 TraceCheckUtils]: 107: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 108: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 109: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 110: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 111: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 112: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 113: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 114: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 115: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 116: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,731 INFO L273 TraceCheckUtils]: 117: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 118: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 119: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 120: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 121: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 122: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 123: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 124: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 125: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,732 INFO L273 TraceCheckUtils]: 126: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 127: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 128: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 129: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 130: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 131: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 132: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 133: Hoare triple {21154#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 134: Hoare triple {21154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 135: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,733 INFO L273 TraceCheckUtils]: 136: Hoare triple {21154#false} assume !(~i~0 < 100000); {21154#false} is VALID [2018-11-18 22:45:33,734 INFO L273 TraceCheckUtils]: 137: Hoare triple {21154#false} havoc ~x~0;~x~0 := 0; {21154#false} is VALID [2018-11-18 22:45:33,734 INFO L273 TraceCheckUtils]: 138: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:45:33,734 INFO L273 TraceCheckUtils]: 139: Hoare triple {21154#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {21154#false} is VALID [2018-11-18 22:45:33,734 INFO L256 TraceCheckUtils]: 140: Hoare triple {21154#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {21154#false} is VALID [2018-11-18 22:45:33,734 INFO L273 TraceCheckUtils]: 141: Hoare triple {21154#false} ~cond := #in~cond; {21154#false} is VALID [2018-11-18 22:45:33,734 INFO L273 TraceCheckUtils]: 142: Hoare triple {21154#false} assume 0 == ~cond; {21154#false} is VALID [2018-11-18 22:45:33,734 INFO L273 TraceCheckUtils]: 143: Hoare triple {21154#false} assume !false; {21154#false} is VALID [2018-11-18 22:45:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-18 22:45:33,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:45:33,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:45:33,755 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:46:09,075 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-18 22:46:09,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:09,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:09,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {21153#true} call ULTIMATE.init(); {21153#true} is VALID [2018-11-18 22:46:09,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {21153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21153#true} is VALID [2018-11-18 22:46:09,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,541 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21153#true} {21153#true} #66#return; {21153#true} is VALID [2018-11-18 22:46:09,541 INFO L256 TraceCheckUtils]: 4: Hoare triple {21153#true} call #t~ret8 := main(); {21153#true} is VALID [2018-11-18 22:46:09,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {21153#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {21153#true} is VALID [2018-11-18 22:46:09,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 29: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 36: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 40: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 41: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 43: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 45: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 46: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 47: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 48: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 49: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 50: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 53: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,547 INFO L273 TraceCheckUtils]: 54: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 55: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 57: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 58: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 59: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 60: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 61: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 62: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,548 INFO L273 TraceCheckUtils]: 63: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 64: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 65: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 66: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 67: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 68: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 69: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 71: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,549 INFO L273 TraceCheckUtils]: 72: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 73: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 74: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 75: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 76: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 77: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 78: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 79: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 81: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,550 INFO L273 TraceCheckUtils]: 82: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 83: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 84: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 85: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 86: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 87: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 88: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 89: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 90: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {21153#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {21153#true} is VALID [2018-11-18 22:46:09,552 INFO L273 TraceCheckUtils]: 92: Hoare triple {21153#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {21153#true} is VALID [2018-11-18 22:46:09,552 INFO L273 TraceCheckUtils]: 93: Hoare triple {21153#true} assume true; {21153#true} is VALID [2018-11-18 22:46:09,552 INFO L273 TraceCheckUtils]: 94: Hoare triple {21153#true} assume !(~a~0 < 100000); {21153#true} is VALID [2018-11-18 22:46:09,552 INFO L273 TraceCheckUtils]: 95: Hoare triple {21153#true} havoc ~i~0;~i~0 := 0; {21473#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:09,553 INFO L273 TraceCheckUtils]: 96: Hoare triple {21473#(<= main_~i~0 0)} assume true; {21473#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:09,553 INFO L273 TraceCheckUtils]: 97: Hoare triple {21473#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21473#(<= main_~i~0 0)} is VALID [2018-11-18 22:46:09,553 INFO L273 TraceCheckUtils]: 98: Hoare triple {21473#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21483#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:09,554 INFO L273 TraceCheckUtils]: 99: Hoare triple {21483#(<= main_~i~0 1)} assume true; {21483#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:09,554 INFO L273 TraceCheckUtils]: 100: Hoare triple {21483#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21483#(<= main_~i~0 1)} is VALID [2018-11-18 22:46:09,554 INFO L273 TraceCheckUtils]: 101: Hoare triple {21483#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21493#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:09,555 INFO L273 TraceCheckUtils]: 102: Hoare triple {21493#(<= main_~i~0 2)} assume true; {21493#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:09,555 INFO L273 TraceCheckUtils]: 103: Hoare triple {21493#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21493#(<= main_~i~0 2)} is VALID [2018-11-18 22:46:09,556 INFO L273 TraceCheckUtils]: 104: Hoare triple {21493#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21503#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:09,557 INFO L273 TraceCheckUtils]: 105: Hoare triple {21503#(<= main_~i~0 3)} assume true; {21503#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:09,557 INFO L273 TraceCheckUtils]: 106: Hoare triple {21503#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21503#(<= main_~i~0 3)} is VALID [2018-11-18 22:46:09,558 INFO L273 TraceCheckUtils]: 107: Hoare triple {21503#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21513#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:09,558 INFO L273 TraceCheckUtils]: 108: Hoare triple {21513#(<= main_~i~0 4)} assume true; {21513#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:09,559 INFO L273 TraceCheckUtils]: 109: Hoare triple {21513#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21513#(<= main_~i~0 4)} is VALID [2018-11-18 22:46:09,560 INFO L273 TraceCheckUtils]: 110: Hoare triple {21513#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21523#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:09,560 INFO L273 TraceCheckUtils]: 111: Hoare triple {21523#(<= main_~i~0 5)} assume true; {21523#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:09,561 INFO L273 TraceCheckUtils]: 112: Hoare triple {21523#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21523#(<= main_~i~0 5)} is VALID [2018-11-18 22:46:09,561 INFO L273 TraceCheckUtils]: 113: Hoare triple {21523#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21533#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:09,562 INFO L273 TraceCheckUtils]: 114: Hoare triple {21533#(<= main_~i~0 6)} assume true; {21533#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:09,562 INFO L273 TraceCheckUtils]: 115: Hoare triple {21533#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21533#(<= main_~i~0 6)} is VALID [2018-11-18 22:46:09,563 INFO L273 TraceCheckUtils]: 116: Hoare triple {21533#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21543#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:09,564 INFO L273 TraceCheckUtils]: 117: Hoare triple {21543#(<= main_~i~0 7)} assume true; {21543#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:09,564 INFO L273 TraceCheckUtils]: 118: Hoare triple {21543#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21543#(<= main_~i~0 7)} is VALID [2018-11-18 22:46:09,565 INFO L273 TraceCheckUtils]: 119: Hoare triple {21543#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21553#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:09,565 INFO L273 TraceCheckUtils]: 120: Hoare triple {21553#(<= main_~i~0 8)} assume true; {21553#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:09,566 INFO L273 TraceCheckUtils]: 121: Hoare triple {21553#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21553#(<= main_~i~0 8)} is VALID [2018-11-18 22:46:09,567 INFO L273 TraceCheckUtils]: 122: Hoare triple {21553#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21563#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:09,574 INFO L273 TraceCheckUtils]: 123: Hoare triple {21563#(<= main_~i~0 9)} assume true; {21563#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:09,575 INFO L273 TraceCheckUtils]: 124: Hoare triple {21563#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21563#(<= main_~i~0 9)} is VALID [2018-11-18 22:46:09,575 INFO L273 TraceCheckUtils]: 125: Hoare triple {21563#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21573#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:09,576 INFO L273 TraceCheckUtils]: 126: Hoare triple {21573#(<= main_~i~0 10)} assume true; {21573#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:09,576 INFO L273 TraceCheckUtils]: 127: Hoare triple {21573#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21573#(<= main_~i~0 10)} is VALID [2018-11-18 22:46:09,576 INFO L273 TraceCheckUtils]: 128: Hoare triple {21573#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21583#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:09,577 INFO L273 TraceCheckUtils]: 129: Hoare triple {21583#(<= main_~i~0 11)} assume true; {21583#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:09,577 INFO L273 TraceCheckUtils]: 130: Hoare triple {21583#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21583#(<= main_~i~0 11)} is VALID [2018-11-18 22:46:09,578 INFO L273 TraceCheckUtils]: 131: Hoare triple {21583#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21593#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:09,578 INFO L273 TraceCheckUtils]: 132: Hoare triple {21593#(<= main_~i~0 12)} assume true; {21593#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:09,578 INFO L273 TraceCheckUtils]: 133: Hoare triple {21593#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {21593#(<= main_~i~0 12)} is VALID [2018-11-18 22:46:09,579 INFO L273 TraceCheckUtils]: 134: Hoare triple {21593#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21603#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:09,579 INFO L273 TraceCheckUtils]: 135: Hoare triple {21603#(<= main_~i~0 13)} assume true; {21603#(<= main_~i~0 13)} is VALID [2018-11-18 22:46:09,580 INFO L273 TraceCheckUtils]: 136: Hoare triple {21603#(<= main_~i~0 13)} assume !(~i~0 < 100000); {21154#false} is VALID [2018-11-18 22:46:09,580 INFO L273 TraceCheckUtils]: 137: Hoare triple {21154#false} havoc ~x~0;~x~0 := 0; {21154#false} is VALID [2018-11-18 22:46:09,581 INFO L273 TraceCheckUtils]: 138: Hoare triple {21154#false} assume true; {21154#false} is VALID [2018-11-18 22:46:09,581 INFO L273 TraceCheckUtils]: 139: Hoare triple {21154#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {21154#false} is VALID [2018-11-18 22:46:09,581 INFO L256 TraceCheckUtils]: 140: Hoare triple {21154#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {21154#false} is VALID [2018-11-18 22:46:09,581 INFO L273 TraceCheckUtils]: 141: Hoare triple {21154#false} ~cond := #in~cond; {21154#false} is VALID [2018-11-18 22:46:09,581 INFO L273 TraceCheckUtils]: 142: Hoare triple {21154#false} assume 0 == ~cond; {21154#false} is VALID [2018-11-18 22:46:09,581 INFO L273 TraceCheckUtils]: 143: Hoare triple {21154#false} assume !false; {21154#false} is VALID [2018-11-18 22:46:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2018-11-18 22:46:09,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:09,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 16] total 46 [2018-11-18 22:46:09,618 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 144 [2018-11-18 22:46:09,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:09,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-18 22:46:09,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:09,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-18 22:46:09,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-18 22:46:09,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1455, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 22:46:09,776 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 46 states. [2018-11-18 22:46:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:10,228 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2018-11-18 22:46:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 22:46:10,228 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 144 [2018-11-18 22:46:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:46:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 178 transitions. [2018-11-18 22:46:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:46:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 178 transitions. [2018-11-18 22:46:10,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 178 transitions. [2018-11-18 22:46:10,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:10,458 INFO L225 Difference]: With dead ends: 211 [2018-11-18 22:46:10,458 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 22:46:10,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=615, Invalid=1455, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 22:46:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 22:46:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-18 22:46:10,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:10,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 155 states. [2018-11-18 22:46:10,913 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 155 states. [2018-11-18 22:46:10,913 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 155 states. [2018-11-18 22:46:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:10,916 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-11-18 22:46:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-11-18 22:46:10,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:10,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:10,917 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 157 states. [2018-11-18 22:46:10,917 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 157 states. [2018-11-18 22:46:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:10,919 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-11-18 22:46:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-11-18 22:46:10,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:10,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:10,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:10,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 22:46:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-11-18 22:46:10,922 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 144 [2018-11-18 22:46:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:10,922 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-11-18 22:46:10,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-18 22:46:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-11-18 22:46:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 22:46:10,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:10,923 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:10,923 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:10,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -360402966, now seen corresponding path program 30 times [2018-11-18 22:46:10,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:10,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:10,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:10,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:11,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {22433#true} call ULTIMATE.init(); {22433#true} is VALID [2018-11-18 22:46:11,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {22433#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22433#true} is VALID [2018-11-18 22:46:11,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {22433#true} assume true; {22433#true} is VALID [2018-11-18 22:46:11,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22433#true} {22433#true} #66#return; {22433#true} is VALID [2018-11-18 22:46:11,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {22433#true} call #t~ret8 := main(); {22433#true} is VALID [2018-11-18 22:46:11,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {22433#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {22435#(= main_~a~0 0)} is VALID [2018-11-18 22:46:11,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {22435#(= main_~a~0 0)} assume true; {22435#(= main_~a~0 0)} is VALID [2018-11-18 22:46:11,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {22435#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22435#(= main_~a~0 0)} is VALID [2018-11-18 22:46:11,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {22435#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22436#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:11,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {22436#(<= main_~a~0 1)} assume true; {22436#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:11,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {22436#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22436#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:11,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {22436#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22437#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:11,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {22437#(<= main_~a~0 2)} assume true; {22437#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:11,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {22437#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22437#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:11,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {22437#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22438#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:11,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {22438#(<= main_~a~0 3)} assume true; {22438#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:11,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {22438#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22438#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:11,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {22438#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22439#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:11,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {22439#(<= main_~a~0 4)} assume true; {22439#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:11,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {22439#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22439#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:11,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {22439#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22440#(<= main_~a~0 5)} is VALID [2018-11-18 22:46:11,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {22440#(<= main_~a~0 5)} assume true; {22440#(<= main_~a~0 5)} is VALID [2018-11-18 22:46:11,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {22440#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22440#(<= main_~a~0 5)} is VALID [2018-11-18 22:46:11,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {22440#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22441#(<= main_~a~0 6)} is VALID [2018-11-18 22:46:11,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {22441#(<= main_~a~0 6)} assume true; {22441#(<= main_~a~0 6)} is VALID [2018-11-18 22:46:11,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {22441#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22441#(<= main_~a~0 6)} is VALID [2018-11-18 22:46:11,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {22441#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22442#(<= main_~a~0 7)} is VALID [2018-11-18 22:46:11,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {22442#(<= main_~a~0 7)} assume true; {22442#(<= main_~a~0 7)} is VALID [2018-11-18 22:46:11,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {22442#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22442#(<= main_~a~0 7)} is VALID [2018-11-18 22:46:11,874 INFO L273 TraceCheckUtils]: 29: Hoare triple {22442#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22443#(<= main_~a~0 8)} is VALID [2018-11-18 22:46:11,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {22443#(<= main_~a~0 8)} assume true; {22443#(<= main_~a~0 8)} is VALID [2018-11-18 22:46:11,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {22443#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22443#(<= main_~a~0 8)} is VALID [2018-11-18 22:46:11,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {22443#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22444#(<= main_~a~0 9)} is VALID [2018-11-18 22:46:11,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {22444#(<= main_~a~0 9)} assume true; {22444#(<= main_~a~0 9)} is VALID [2018-11-18 22:46:11,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {22444#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22444#(<= main_~a~0 9)} is VALID [2018-11-18 22:46:11,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {22444#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22445#(<= main_~a~0 10)} is VALID [2018-11-18 22:46:11,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {22445#(<= main_~a~0 10)} assume true; {22445#(<= main_~a~0 10)} is VALID [2018-11-18 22:46:11,879 INFO L273 TraceCheckUtils]: 37: Hoare triple {22445#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22445#(<= main_~a~0 10)} is VALID [2018-11-18 22:46:11,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {22445#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22446#(<= main_~a~0 11)} is VALID [2018-11-18 22:46:11,880 INFO L273 TraceCheckUtils]: 39: Hoare triple {22446#(<= main_~a~0 11)} assume true; {22446#(<= main_~a~0 11)} is VALID [2018-11-18 22:46:11,880 INFO L273 TraceCheckUtils]: 40: Hoare triple {22446#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22446#(<= main_~a~0 11)} is VALID [2018-11-18 22:46:11,881 INFO L273 TraceCheckUtils]: 41: Hoare triple {22446#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22447#(<= main_~a~0 12)} is VALID [2018-11-18 22:46:11,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {22447#(<= main_~a~0 12)} assume true; {22447#(<= main_~a~0 12)} is VALID [2018-11-18 22:46:11,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {22447#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22447#(<= main_~a~0 12)} is VALID [2018-11-18 22:46:11,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {22447#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22448#(<= main_~a~0 13)} is VALID [2018-11-18 22:46:11,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {22448#(<= main_~a~0 13)} assume true; {22448#(<= main_~a~0 13)} is VALID [2018-11-18 22:46:11,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {22448#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22448#(<= main_~a~0 13)} is VALID [2018-11-18 22:46:11,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {22448#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22449#(<= main_~a~0 14)} is VALID [2018-11-18 22:46:11,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {22449#(<= main_~a~0 14)} assume true; {22449#(<= main_~a~0 14)} is VALID [2018-11-18 22:46:11,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {22449#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22449#(<= main_~a~0 14)} is VALID [2018-11-18 22:46:11,886 INFO L273 TraceCheckUtils]: 50: Hoare triple {22449#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22450#(<= main_~a~0 15)} is VALID [2018-11-18 22:46:11,887 INFO L273 TraceCheckUtils]: 51: Hoare triple {22450#(<= main_~a~0 15)} assume true; {22450#(<= main_~a~0 15)} is VALID [2018-11-18 22:46:11,887 INFO L273 TraceCheckUtils]: 52: Hoare triple {22450#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22450#(<= main_~a~0 15)} is VALID [2018-11-18 22:46:11,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {22450#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22451#(<= main_~a~0 16)} is VALID [2018-11-18 22:46:11,889 INFO L273 TraceCheckUtils]: 54: Hoare triple {22451#(<= main_~a~0 16)} assume true; {22451#(<= main_~a~0 16)} is VALID [2018-11-18 22:46:11,889 INFO L273 TraceCheckUtils]: 55: Hoare triple {22451#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22451#(<= main_~a~0 16)} is VALID [2018-11-18 22:46:11,890 INFO L273 TraceCheckUtils]: 56: Hoare triple {22451#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22452#(<= main_~a~0 17)} is VALID [2018-11-18 22:46:11,890 INFO L273 TraceCheckUtils]: 57: Hoare triple {22452#(<= main_~a~0 17)} assume true; {22452#(<= main_~a~0 17)} is VALID [2018-11-18 22:46:11,891 INFO L273 TraceCheckUtils]: 58: Hoare triple {22452#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22452#(<= main_~a~0 17)} is VALID [2018-11-18 22:46:11,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {22452#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22453#(<= main_~a~0 18)} is VALID [2018-11-18 22:46:11,892 INFO L273 TraceCheckUtils]: 60: Hoare triple {22453#(<= main_~a~0 18)} assume true; {22453#(<= main_~a~0 18)} is VALID [2018-11-18 22:46:11,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {22453#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22453#(<= main_~a~0 18)} is VALID [2018-11-18 22:46:11,893 INFO L273 TraceCheckUtils]: 62: Hoare triple {22453#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22454#(<= main_~a~0 19)} is VALID [2018-11-18 22:46:11,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {22454#(<= main_~a~0 19)} assume true; {22454#(<= main_~a~0 19)} is VALID [2018-11-18 22:46:11,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {22454#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22454#(<= main_~a~0 19)} is VALID [2018-11-18 22:46:11,895 INFO L273 TraceCheckUtils]: 65: Hoare triple {22454#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22455#(<= main_~a~0 20)} is VALID [2018-11-18 22:46:11,896 INFO L273 TraceCheckUtils]: 66: Hoare triple {22455#(<= main_~a~0 20)} assume true; {22455#(<= main_~a~0 20)} is VALID [2018-11-18 22:46:11,896 INFO L273 TraceCheckUtils]: 67: Hoare triple {22455#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22455#(<= main_~a~0 20)} is VALID [2018-11-18 22:46:11,897 INFO L273 TraceCheckUtils]: 68: Hoare triple {22455#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22456#(<= main_~a~0 21)} is VALID [2018-11-18 22:46:11,897 INFO L273 TraceCheckUtils]: 69: Hoare triple {22456#(<= main_~a~0 21)} assume true; {22456#(<= main_~a~0 21)} is VALID [2018-11-18 22:46:11,898 INFO L273 TraceCheckUtils]: 70: Hoare triple {22456#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22456#(<= main_~a~0 21)} is VALID [2018-11-18 22:46:11,899 INFO L273 TraceCheckUtils]: 71: Hoare triple {22456#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22457#(<= main_~a~0 22)} is VALID [2018-11-18 22:46:11,899 INFO L273 TraceCheckUtils]: 72: Hoare triple {22457#(<= main_~a~0 22)} assume true; {22457#(<= main_~a~0 22)} is VALID [2018-11-18 22:46:11,900 INFO L273 TraceCheckUtils]: 73: Hoare triple {22457#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22457#(<= main_~a~0 22)} is VALID [2018-11-18 22:46:11,900 INFO L273 TraceCheckUtils]: 74: Hoare triple {22457#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22458#(<= main_~a~0 23)} is VALID [2018-11-18 22:46:11,901 INFO L273 TraceCheckUtils]: 75: Hoare triple {22458#(<= main_~a~0 23)} assume true; {22458#(<= main_~a~0 23)} is VALID [2018-11-18 22:46:11,901 INFO L273 TraceCheckUtils]: 76: Hoare triple {22458#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22458#(<= main_~a~0 23)} is VALID [2018-11-18 22:46:11,902 INFO L273 TraceCheckUtils]: 77: Hoare triple {22458#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22459#(<= main_~a~0 24)} is VALID [2018-11-18 22:46:11,903 INFO L273 TraceCheckUtils]: 78: Hoare triple {22459#(<= main_~a~0 24)} assume true; {22459#(<= main_~a~0 24)} is VALID [2018-11-18 22:46:11,903 INFO L273 TraceCheckUtils]: 79: Hoare triple {22459#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22459#(<= main_~a~0 24)} is VALID [2018-11-18 22:46:11,904 INFO L273 TraceCheckUtils]: 80: Hoare triple {22459#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22460#(<= main_~a~0 25)} is VALID [2018-11-18 22:46:11,904 INFO L273 TraceCheckUtils]: 81: Hoare triple {22460#(<= main_~a~0 25)} assume true; {22460#(<= main_~a~0 25)} is VALID [2018-11-18 22:46:11,905 INFO L273 TraceCheckUtils]: 82: Hoare triple {22460#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22460#(<= main_~a~0 25)} is VALID [2018-11-18 22:46:11,906 INFO L273 TraceCheckUtils]: 83: Hoare triple {22460#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22461#(<= main_~a~0 26)} is VALID [2018-11-18 22:46:11,906 INFO L273 TraceCheckUtils]: 84: Hoare triple {22461#(<= main_~a~0 26)} assume true; {22461#(<= main_~a~0 26)} is VALID [2018-11-18 22:46:11,907 INFO L273 TraceCheckUtils]: 85: Hoare triple {22461#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22461#(<= main_~a~0 26)} is VALID [2018-11-18 22:46:11,907 INFO L273 TraceCheckUtils]: 86: Hoare triple {22461#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22462#(<= main_~a~0 27)} is VALID [2018-11-18 22:46:11,908 INFO L273 TraceCheckUtils]: 87: Hoare triple {22462#(<= main_~a~0 27)} assume true; {22462#(<= main_~a~0 27)} is VALID [2018-11-18 22:46:11,908 INFO L273 TraceCheckUtils]: 88: Hoare triple {22462#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22462#(<= main_~a~0 27)} is VALID [2018-11-18 22:46:11,909 INFO L273 TraceCheckUtils]: 89: Hoare triple {22462#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22463#(<= main_~a~0 28)} is VALID [2018-11-18 22:46:11,910 INFO L273 TraceCheckUtils]: 90: Hoare triple {22463#(<= main_~a~0 28)} assume true; {22463#(<= main_~a~0 28)} is VALID [2018-11-18 22:46:11,910 INFO L273 TraceCheckUtils]: 91: Hoare triple {22463#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22463#(<= main_~a~0 28)} is VALID [2018-11-18 22:46:11,911 INFO L273 TraceCheckUtils]: 92: Hoare triple {22463#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22464#(<= main_~a~0 29)} is VALID [2018-11-18 22:46:11,911 INFO L273 TraceCheckUtils]: 93: Hoare triple {22464#(<= main_~a~0 29)} assume true; {22464#(<= main_~a~0 29)} is VALID [2018-11-18 22:46:11,912 INFO L273 TraceCheckUtils]: 94: Hoare triple {22464#(<= main_~a~0 29)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {22464#(<= main_~a~0 29)} is VALID [2018-11-18 22:46:11,913 INFO L273 TraceCheckUtils]: 95: Hoare triple {22464#(<= main_~a~0 29)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {22465#(<= main_~a~0 30)} is VALID [2018-11-18 22:46:11,913 INFO L273 TraceCheckUtils]: 96: Hoare triple {22465#(<= main_~a~0 30)} assume true; {22465#(<= main_~a~0 30)} is VALID [2018-11-18 22:46:11,914 INFO L273 TraceCheckUtils]: 97: Hoare triple {22465#(<= main_~a~0 30)} assume !(~a~0 < 100000); {22434#false} is VALID [2018-11-18 22:46:11,914 INFO L273 TraceCheckUtils]: 98: Hoare triple {22434#false} havoc ~i~0;~i~0 := 0; {22434#false} is VALID [2018-11-18 22:46:11,914 INFO L273 TraceCheckUtils]: 99: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,914 INFO L273 TraceCheckUtils]: 100: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,915 INFO L273 TraceCheckUtils]: 101: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,915 INFO L273 TraceCheckUtils]: 102: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,915 INFO L273 TraceCheckUtils]: 103: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,915 INFO L273 TraceCheckUtils]: 104: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,915 INFO L273 TraceCheckUtils]: 105: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,915 INFO L273 TraceCheckUtils]: 106: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,916 INFO L273 TraceCheckUtils]: 107: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,916 INFO L273 TraceCheckUtils]: 108: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,916 INFO L273 TraceCheckUtils]: 109: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,916 INFO L273 TraceCheckUtils]: 110: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,916 INFO L273 TraceCheckUtils]: 111: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 112: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 113: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 114: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 115: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 116: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 117: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 118: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 119: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 120: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,917 INFO L273 TraceCheckUtils]: 121: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 122: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 123: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 124: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 125: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 126: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 127: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 128: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 129: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 130: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,918 INFO L273 TraceCheckUtils]: 131: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 132: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 133: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 134: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 135: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 136: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 137: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 138: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 139: Hoare triple {22434#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {22434#false} is VALID [2018-11-18 22:46:11,919 INFO L273 TraceCheckUtils]: 140: Hoare triple {22434#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 141: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 142: Hoare triple {22434#false} assume !(~i~0 < 100000); {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 143: Hoare triple {22434#false} havoc ~x~0;~x~0 := 0; {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 144: Hoare triple {22434#false} assume true; {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 145: Hoare triple {22434#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L256 TraceCheckUtils]: 146: Hoare triple {22434#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 147: Hoare triple {22434#false} ~cond := #in~cond; {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 148: Hoare triple {22434#false} assume 0 == ~cond; {22434#false} is VALID [2018-11-18 22:46:11,920 INFO L273 TraceCheckUtils]: 149: Hoare triple {22434#false} assume !false; {22434#false} is VALID [2018-11-18 22:46:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-18 22:46:11,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:11,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:11,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE